codeforces #199 C. Cupboard and Balloons 题解

转载请注明：http://blog.csdn.net/jiangshibiao/article/details/23164145

【原题】

C. Cupboard and Balloons

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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).

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 . 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

【分析】因为矩形的宽=2*r，很容易想到自底向上两个两个放上去。

#include<cstdio>
using namespace std;
int r,h,n,ans;
int main()
{
  scanf("%d%d",&r,&h);
  ans=h/r*2;
  if (h%r>=double(r)/double(2)) ans+=2;else ans++;
  printf("%d",ans);
  return 0;
}

开始我没怎么仔细想，直接以上代码交上去，结果第17个点WA了。数据摘录于此：3983458,7761504.为什么这组会错呢？我发现从底层放上去只有2个，因此最后输出4了。但是答案是5！原来，ans+1和ans+2都满足。

也就是说，可能有一种情况，可以多放两个再多放一个。

以下图片可以看出：

我们可以算出，GH=2-sqrt（3）。详细算法见代码。

【AC代码】

#include<cstdio>
#include<cmath>
using namespace std;
int n,ans;
double r,h;
int main()
{
  scanf("%lf%lf",&r,&h);
  ans=int(h/r)*2;h-=int(h/r)*r;
  if (h>=(r+0.0)/2.0) ans+=2,h-=r;
  h+=r+(2.0-sqrt(3.0))*r/2.0;
  if (h>=r) ans++;
  printf("%d",ans);
  return 0;
}