AtCoder:Widespread(二分)
来源:互联网 发布:人工智能自然语义分析 编辑:程序博客网 时间:2024/06/05 07:27
D - Widespread
Time limit : 2sec / Memory limit : 256MB
Score : 400 points
Problem Statement
You are going out for a walk, when you suddenly encounter N monsters. Each monster has a parameter called health, and the health of the i-th monster is hi at the moment of encounter. A monster will vanish immediately when its health drops to 0 or below.
Fortunately, you are a skilled magician, capable of causing explosions that damage monsters. In one explosion, you can damage monsters as follows:
- Select an alive monster, and cause an explosion centered at that monster. The health of the monster at the center of the explosion will decrease by A, and the health of each of the other monsters will decrease by B. Here, A and B are predetermined parameters, and A>B holds.
At least how many explosions do you need to cause in order to vanish all the monsters?
Constraints
- All input values are integers.
- 1≤N≤105
- 1≤B<A≤109
- 1≤hi≤109
Input
Input is given from Standard Input in the following format:
N A Bh1h2:hN
Output
Print the minimum number of explosions that needs to be caused in order to vanish all the monsters.
Sample Input 1
4 5 38742
Sample Output 1
2
You can vanish all the monsters in two explosion, as follows:
- First, cause an explosion centered at the monster with 8 health. The healths of the four monsters become 3, 4, 1 and −1, respectively, and the last monster vanishes.
- Second, cause an explosion centered at the monster with 4 health remaining. The healths of the three remaining monsters become 0, −1 and −2, respectively, and all the monsters are now vanished.
Sample Input 2
2 10 42020
Sample Output 2
4
You need to cause two explosions centered at each monster, for a total of four.
Sample Input 3
5 2 1900000000900000000100000000010000000001000000000
Sample Output 3
800000000
思路:二分答案即可,每只怪物减去x*b血,如果还没死就再砍blood/(A-B)次。
# include <bits/stdc++.h>using namespace std;typedef long long LL;const int maxn = 1e5;int n, a, b, m[maxn+3];bool judge(LL x){ LL sum = 0; for(int i=0; i<n; ++i) { LL t = (LL)m[i]-x*b; if(t>0) { sum += (int)ceil(t*1.0/(a-b)); if(sum > x || sum < 0) return false; } } return true;}int main(){ while(~scanf("%d%d%d",&n,&a,&b)) { int imax = 0; for(int i=0; i<n; ++i) scanf("%d",&m[i]), imax = max(imax, m[i]); LL l=0, r=imax; while(l<r) { LL mid = l+r>>1; if(judge(mid)) r=mid; else l=mid+1; } printf("%lld\n",r); } return 0;}
- AtCoder:Widespread(二分)
- Atcoder 056 D 贪心+二分
- 【AtCoder】(AtCoder Grand Contest 006)D
- 【AtCoder】(AtCoder Grand Contest 004)E
- AtCoder:AtCoder Group Contest(思维)
- Atcoder-Sports Festival(二分+暴力+思维+贪心)
- AtCoder:井井井 / ###(数学)
- AtCoder:Connected?(思维)
- AtCoder
- AtCoder
- AtCoder
- AtCoder
- AtCoder
- Atcoder
- AtCoder Grand Contest 011 A\B 贪心、二分
- [AtCoder ARC076 .F] [二分图] [霍尔定理] Exhausted?
- [AtCoder ARC076 .F] [二分图] [霍尔定理] Exhausted?
- [整体二分 并查集]Atcoder AGC002 D. Stamp Rally
- 自学Java之Java类库(使用颜色、字体和图形)(013day)
- 125. Valid Palindrome
- Vlan配置及好处
- CSS3阴影 box-shadow的使用和技巧总结
- Gradle报disposed错误解决方法
- AtCoder:Widespread(二分)
- JavaScript中常见的字符串操作函数及用法
- 测试
- 异常断电后gitlab无法使用,访问出现502错误
- 微信小程序教程(二)
- ready()事件与load()事件的区别
- Android Studio 常用快捷键
- hash算法原理详解
- 总结几种结构体初始化的方法(转)