Codeforces Round #199 (Div. 2) C. Cupboard and Balloons
2013-09-12 22:32
405 查看
C. Cupboard and Balloonstime limit per test
2 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputA 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
![](http://codeforces.ru/renderer/a4fcadf5554db1a524f8d91fc4f6fb6d9fa61718.png)
. 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
2 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputA 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).
![](http://codeforces.ru/renderer/0d3a8ee208fe4f3ad9899a205032d363d083f939.png)
![](http://codeforces.ru/renderer/a4fcadf5554db1a524f8d91fc4f6fb6d9fa61718.png)
. 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 1output
3input
1 2output
5input
2 1output
2
几何题,有点坑,有个地方没想清楚,一直wrong,我们可以先把长方形的那部分尽可能的多放,然后,我们可以,找到剩下的空间,刚好放两个球,和刚好放三个球的情况,这样,我们就可以得出公式了!
#include <iostream> #include <stdio.h> #include <string.h> #include <math.h> using namespace std; int main() { double h,r;double temp=sqrt(3.0)/2.0; while(scanf("%lf%lf",&r,&h)!=EOF){ int ans=2*(int)(h/r); double t=h-ans/2.0*1.0*r; //printf("%d %.6f %.6f\n",ans,t,temp*r); if(t<r/2.0)ans++; else if(t<temp*r)ans+=2; else ans+=3; printf("%d\n",ans); } return 0; }
相关文章推荐
- Codeforces Round #199 (Div. 2) -- C. Cupboard and Balloons (数学)
- Codeforces Round #199 (Div. 2) B. Xenia and Spies
- Codeforces Round #199 (Div. 2) E. Xenia and Tree
- Codeforces Round #199 (Div. 2) A. Xenia and Divisors
- codeforces #199 C. Cupboard and Balloons 题解
- Codeforces Round #403 (Div. 2, based on Technocup 2017 Finals) C Andryusha and Colored Balloons
- Codeforces Round #199 (Div. 2) B. Xenia and Spies
- Codeforces Round #199 (Div. 2) B. Xenia and Spies(贪心)
- Codeforces Round #210 (Div. 2) A. Levko and Table
- Codeforces Round #442 (Div. 2) E. Danil and a Part-time Job DFS序+树链剖分+线段树区间^
- Codeforces Round #199 (Div. 2) E. Xenia and Tree (非正规解法 分情况dfs)
- ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined)
- Codeforces Round #199 (Div. 2)
- Codeforces Round #179 (Div. 1) A. Greg and Array
- Codeforces Round #331 (Div. 2) _A. Wilbur and Swimming Pool
- Codeforces Round #277.5 (Div. 2)C. Given Length and Sum of Digits...(贪心)
- Codeforces Round #419 (Div. 1) C. Karen and Supermarket(树上背包)
- Codeforces Round #204 (Div. 2) A.Jeff and Digits
- 【Codeforces Round 333 (Div 2)E】【期望DP概率做法 树状数组转前缀和】Kleofáš and the n-thlon n场比赛m个人获得总名次的期望
- Codeforces Round #420 (Div. 2) E. Okabe and El Psy Kongroo DP+矩阵快速幂加速