【15.93%】【codeforces 672D】Robin Hood
来源:互联网 发布:推广产品的软件 编辑:程序博客网 时间:2024/06/05 07:11
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poor.
There are n citizens in Kekoland, each person has ci coins. Each day, Robin Hood will take exactly 1 coin from the richest person in the city and he will give it to the poorest person (poorest person right after taking richest’s 1 coin). In case the choice is not unique, he will select one among them at random. Sadly, Robin Hood is old and want to retire in k days. He decided to spend these last days with helping poor people.
After taking his money are taken by Robin Hood richest person may become poorest person as well, and it might even happen that Robin Hood will give his money back. For example if all people have same number of coins, then next day they will have same number of coins too.
Your task is to find the difference between richest and poorest persons wealth after k days. Note that the choosing at random among richest and poorest doesn’t affect the answer.
Input
The first line of the input contains two integers n and k (1 ≤ n ≤ 500 000, 0 ≤ k ≤ 109) — the number of citizens in Kekoland and the number of days left till Robin Hood’s retirement.
The second line contains n integers, the i-th of them is ci (1 ≤ ci ≤ 109) — initial wealth of the i-th person.
Output
Print a single line containing the difference between richest and poorest peoples wealth.
Examples
input
4 1
1 1 4 2
output
2
input
3 1
2 2 2
output
0
Note
Lets look at how wealth changes through day in the first sample.
[1, 1, 4, 2]
[2, 1, 3, 2] or [1, 2, 3, 2]
So the answer is 3 - 1 = 2
In second sample wealth will remain the same for each person.
【题解】
最后变成一样的话->平均数;
小于平均数的要增大。
大于平均数的要减小。
二分获取最后的最小值的最大值以及最大值的最小值;
->判断一个数字可不可行的依据
->比如获取最小值的最大值
->看比当前的值小的值需要增加多少
->小于等于k->可行
->否则不可行
不断逼近那个k;
最后获取答案=maxmin-minmax
但是要注意;
如果∑c[i] % n !=0 则最后答案是不可能相等的。因此如果求出来等于0
是因为用来枚举的右端点和左端点一样了;
因此把答案直接改成1;
->∑c[i]%n==0的话最后是肯定都能变成一样的。
多想想吧
如果想加快速度。可以把数组排下序。
用个lower_bound什么的快速检索比它大的
->再用个前缀和什么的就更完美了;
#include <cstdio>#include <cmath>#include <iostream>#include <algorithm>#include <cstring>#include <queue>#include <vector>#include <stack>#define LL long longusing namespace std;const int MAXN = 6e5;const int INF = 2100000000;struct dingxiao{ int adj; int val; friend bool operator<(dingxiao a, dingxiao b) { return a.val > b.val; }};struct dingda{ int adj; int val; friend bool operator<(dingda a, dingda b) { return a.val < b.val; }};priority_queue<dingxiao>Qdingxiao;priority_queue<dingda>Qdingda;int n, k;int c[MAXN];void input(int &r){ r = 0; char t = getchar(); while (!isdigit(t)) t = getchar(); int sign = 1; if (t == '-')sign = -1; while (!isdigit(t)) t = getchar(); while (isdigit(t)) r = r * 10 + t - '0', t = getchar(); r = r*sign;}int main(){ //freopen("F:\\rush.txt", "r", stdin); input(n); input(k); LL sum = 0; for (int i = 1; i <= n; i++) input(c[i]),sum+=c[i]; LL average = sum / n; LL l = 0, r = average; LL minmax; while (l <= r) { LL mid = (l + r) >> 1; LL kk = 0; for (int i = 1;i <= n;i++) if (c[i] < mid) kk += mid - c[i]; if (kk <= k) minmax = mid, l = mid + 1; else r = mid - 1; } l = average, r = INF; LL maxmin; while (l <= r) { LL mid = (l + r) >> 1; LL kk = 0; for (int i = 1; i <= n; i++) if (mid < c[i]) kk += c[i] - mid; if (kk <= k) maxmin = mid, r = mid - 1; else l = mid + 1; } LL ans = maxmin - minmax; if (!ans) if (sum%n) ans = 1; printf("%I64d\n", ans); return 0;}
- 【15.93%】【codeforces 672D】Robin Hood
- Codeforces 672D Robin Hood
- codeforces 672D. Robin Hood(暴力)
- Codeforces 672D Robin Hood (二分)
- codeforces 672D Robin Hood (二分)
- CodeForces 672D Robin Hood(二分)
- CodeForces 672D Robin Hood(二分)
- codeforces 672D D. Robin Hood (二分+思维)
- CodeForces - 672D Robin Hood (二分)好题
- Codeforces 672D Robin Hood 二分判定+思维
- CodeForces 672D Robin Hood(二分 + 思维)
- cf 672d Robin Hood 【二分】
- Codeforces 672D Robin Hood【思维+二分】这题思路有点劲啊
- Codeforces Round #352 (Div. 2) D. Robin Hood
- Codeforces #352 Div2 D Robin Hood(二分查找)
- Codeforces Round #352 (Div. 2) D Robin Hood : 模拟
- codefores 352 D. Robin Hood
- CodeForces 671B Robin Hood
- linux 下的浏览器设置为baidu模式
- Ubuntu 安装必备软件
- 从这里开始
- 当活动被回收,再次启动时使数据不丢失
- 美团购买框悬浮效果
- 【15.93%】【codeforces 672D】Robin Hood
- 当在64位linux编译uboot的时候会提示很多so没有
- 【部署】bitnami快速部署mantis、gerrit
- monkey测试环境搭建
- Java中的访问控制符与修饰符浅析
- 421. Maximum XOR of Two Numbers in an Array详解
- java图片文字识别技术
- 【栈应用】迷宫问题
- 在ubuntu14.04上安装mysql