codeforces 342C Cupboard and Balloons(公式题)

时间：2023-03-09 04:29:50
codeforces 342C Cupboard and Balloons(公式题)

转载请注明出处： http://www.cnblogs.com/fraud/          ——by fraud

C. Cupboard and Balloons

A girl named Xenia has a cupboard that looks like an arc from ahead. The arc is made of a semicircle with radius r (the cupboard's top) and two walls of height h (the cupboard's sides). The cupboard's depth is r, that is, it looks like a rectangle with base r and height h + rfrom the sides. The figure below shows what the cupboard looks like (the front view is on the left, the side view is on the right).

codeforces 342C Cupboard and Balloons(公式题)

Xenia got lots of balloons for her birthday. The girl hates the mess, so she wants to store the balloons in the cupboard. Luckily, each balloon is a sphere with radius codeforces 342C Cupboard and Balloons(公式题). Help Xenia calculate the maximum number of balloons she can put in her cupboard.

You can say that a balloon is in the cupboard if you can't see any part of the balloon on the left or right view. The balloons in the cupboard can touch each other. It is not allowed to squeeze the balloons or deform them in any way. You can assume that the cupboard's walls are negligibly thin.

Input

The single line contains two integers r, h (1 ≤ r, h ≤ 107).

Output

Print a single integer — the maximum number of balloons Xenia can put in the cupboard.

Sample test(s)
input
1 1
output
3
input
1 2
output
5
input
2 1
output
2

 

考虑到从下往上开始摆的空间利用率高，于是只需要考虑最终的顶上还能否再塞进一个气球即可。

 //#####################

 //Author:fraud

 //Blog: http://www.cnblogs.com/fraud/

 //#####################

 #include <iostream>

 #include <sstream>

 #include <ios>

 #include <iomanip>

 #include <functional>

 #include <algorithm>

 #include <vector>

 #include <string>

 #include <list>

 #include <queue>

 #include <deque>

 #include <stack>

 #include <set>

 #include <map>

 #include <cstdio>

 #include <cstdlib>

 #include <cmath>

 #include <cstring>

 #include <climits>

 #include <cctype>

 using namespace std;

 #define XINF INT_MAX

 #define INF 0x3FFFFFFF

 #define MP(X,Y) make_pair(X,Y)

 #define PB(X) push_back(X)

 #define REP(X,N) for(int X=0;X<N;X++)

 #define REP2(X,L,R) for(int X=L;X<=R;X++)

 #define DEP(X,R,L) for(int X=R;X>=L;X--)

 #define CLR(A,X) memset(A,X,sizeof(A))

 #define IT iterator

 typedef long long ll;

 typedef pair<int,int> PII;

 typedef vector<PII> VII;

 typedef vector<int> VI;

 int main()

 {

     ios::sync_with_stdio(false);

     double r,h;

     while(cin>>r>>h){

         double tmp=(h+r/);

         int ans=(int)(tmp/r+1e-);

         tmp-=ans*r;

         ans*=;

         tmp+=r/;

         if(tmp-r*(sqrt(3.0)/)>-1e-)ans++;

         cout<<ans<<endl;

     }

     return ;

 }

代码君

相关文章