Codeforces Round #312 (Div. 2) C.Amr and Chemistry
2015-07-25 23:14
357 查看
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?
Input
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
Output one integer the minimum number of operations required to make all the chemicals volumes equal.
Sample test(s)
input
output
input
output
Note
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.
题解:按值爆搜交上去就满了。。。
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?
Input
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
Output one integer the minimum number of operations required to make all the chemicals volumes equal.
Sample test(s)
input
3 4 8 2
output
2
input
3 3 5 6
output
5
Note
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.
题解:按值爆搜交上去就满了。。。
#include<iostream> #include<cstdio> #include<cmath> #include<algorithm> #include<queue> #include<cstring> #define PAU putchar(' ') #define ENT putchar('\n') using namespace std; const int maxn=100000+10,maxv=100000,inf=-1u>>1; int vis[maxn],cnt[maxn],stp[maxn],n; inline int read(){ int x=0,sig=1;char ch=getchar(); while(!isdigit(ch)){if(ch=='-')sig=-1;ch=getchar();} while(isdigit(ch))x=10*x+ch-'0',ch=getchar(); return x*=sig; } inline void write(int x){ if(x==0){putchar('0');return;}if(x<0)putchar('-'),x=-x; int len=0,buf[15];while(x)buf[len++]=x%10,x/=10; for(int i=len-1;i>=0;i--)putchar(buf[i]+'0');return; } void init(){ n=read(); queue<pair<int,int> >Q; for(int i=1;i<=n;i++){ int num=read();Q.push(make_pair(num,0)); while(!Q.empty()){ int x=Q.front().first,y=Q.front().second;Q.pop(); if(x>maxv||vis[x]==i)continue; vis[x]=i;cnt[x]++;stp[x]+=y; Q.push(make_pair(x<<1,y+1)); Q.push(make_pair(x>>1,y+1)); } } int mi=inf; for(int i=0;i<=maxv;i++)if(cnt[i]==n&&stp[i]<mi)mi=stp[i]; write(mi); return; } void work(){ return; } void print(){ return; } int main(){init();work();print();return 0;}
相关文章推荐
- python中的参数传递
- 人物美白
- 关于近段时间论坛型APP 的一段舍弃
- Use '$' instead of '.' for inner classes (or use only lowercase letters in package names)
- 工作两周年记------今晚和三个兄弟一起痛快地喝了一次, 在《祝你一路顺风》的旋律中!
- hdu杭电 1379 DNA Sorting
- Floyd-Warshall+二进制枚举SRM 661 Div2 Medium: BridgeBuilding
- Codeforces Round #312 (Div. 2) B.Amr and The Large Array
- vbox centos安装增强工具
- vbox centos安装增强工具
- “小懒虫”安卓手机控制电脑关机
- android利用GPS和高德地图获取定位案例
- shell脚本:shell的基本元素-5 基本的I/O重定向
- http_servlet
- Codeforces Round #312 (Div. 2) A.Lala Land and Apple Trees
- Linux --- command line interface(0)
- 如何使用图像绘制区域wpf
- hdu杭电3788 ZOJ问题
- leetcode-202-Happy Number
- POJ1159 Palindrome