Codeforces 558C Amr and Chemistry 暴力 - -
来源:互联网 发布:淘宝天猫购物券 编辑:程序博客网 时间:2024/06/12 01:43
点击打开链接
Amr loves Chemistry, and specially doing experiments. He is preparing for a new interesting experiment.
Amr has n different types of chemicals. Each chemical i has an initial volume of ai liters. For this experiment, Amr has to mix all the chemicals together, but all the chemicals volumes must be equal first. So his task is to make all the chemicals volumes equal.
To do this, Amr can do two different kind of operations.
- Choose some chemical i and double its current volume so the new volume will be 2ai
- Choose some chemical i and divide its volume by two (integer division) so the new volume will be
Suppose that each chemical is contained in a vessel of infinite volume. Now Amr wonders what is the minimum number of operations required to make all the chemicals volumes equal?
The first line contains one number n (1 ≤ n ≤ 105), the number of chemicals.
The second line contains n space separated integers ai (1 ≤ ai ≤ 105), representing the initial volume of the i-th chemical in liters.
Output one integer the minimum number of operations required to make all the chemicals volumes equal.
34 8 2
2
33 5 6
5
In the first sample test, the optimal solution is to divide the second chemical volume by two, and multiply the third chemical volume by two to make all the volumes equal 4.
In the second sample test, the optimal solution is to divide the first chemical volume by two, and divide the second and the third chemical volumes by two twice to make all the volumes equal 1.
问要将所有数变成一样需要的最少操作数
由于数范围比较小
就可以直接暴力每个数进行操作后能到达的数和到达这个数需要的操作量
然后对于cnt[i]==n的数中的操作数找出最小
#include<cstdio>#include<cstring>#include<algorithm>#define MAXN 222222#define INF 0x3f3f3f3fusing namespace std;int cnt[MAXN],step[MAXN];int a[MAXN];void solve(int num){ int xx=num; int res=0; cnt[num]++; while(xx<=100000){ xx*=2; cnt[xx]++; res++; step[xx]+=res; } xx=num,res=0; while(xx>1){ if(xx&1){ int xres=res+1; int xxx=xx/2; while(xxx<=100000){ xxx*=2; xres++; step[xxx]+=xres; cnt[xxx]++; } } xx/=2; res++; cnt[xx]++; step[xx]+=res; }}int main(){ int n; memset(cnt,0,sizeof(cnt)); memset(step,0,sizeof(step)); scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); for(int i=1;i<=n;i++) solve(a[i]); int ans=INF; for(int i=1;i<MAXN;i++){ if(cnt[i]==n){ ans=min(ans,step[i]); } } printf("%d\n",ans); return 0;}
- Codeforces 558C Amr and Chemistry 暴力 - -
- 暴力 + 贪心 --- Codeforces 558C : Amr and Chemistry
- codeforces 558 C Amr and Chemistry
- Codeforces 558C Amr and Chemistry 规律
- Codeforces 558C Amr and Chemistry
- codeforces 558C Amr and Chemistry
- Codeforces 558C - Amr and Chemistry (枚举)
- Codeforces 558C Amr and Chemistry
- 【23.39%】【codeforces 558C】Amr and Chemistry
- CodeForces 558 C. Amr and Chemistry && 51NOD 1483 化学变换(暴力 + 贪心)
- CF 558 C. Amr and Chemistry 暴力+二进制
- 558C Amr and Chemistry
- Codeforces 558C Amr and Chemistry 位操作
- Codeforces 558C Amr and Chemistry 全都变相等
- Codeforces 558C Amr and Chemistry(dp)
- Codeforces 558C Amr and Chemistry(数论+位运算)
- codeforces 558C Amr and Chemistry(位操作)
- Codeforces 558C. Amr and Chemistry(暴搞)
- Mysql5.6审计功能
- ofbiz 订单信息
- HDOJ 1241 Oil Deposits(8方位简单dfs)
- JdbcTemplate详解
- HDU 5289 Assignment(2015 多校第一场二分 + RMQ)
- Codeforces 558C Amr and Chemistry 暴力 - -
- ofbiz 购物车
- 关于导航栏设置的一些操作
- Html5存储总结(未完)
- 安卓android属性中的px,sp,dip有什么区别?
- SDWebImage内存缓存 磁盘缓存
- jQuery 实现 点击按钮后倒计时效果,多用于实现发送手机验证码、邮箱验证码
- Apache OFBiz Business Setup Guide - OFBiz End-User Documentatio
- POJ 2488 A Knight's Journey