codefoces 558C Amr and Chemistry (bfs)

题解:

题意为给定n个数，允许有2种操作，一种是乘2 一种是除2（向下取整） 问最小需要几次操作使得n个数相等

首先发现一个显然的性质 答案不可能超过$2e5$，然后我们发现对于这类题目多会用$bfs$来解决，由于值的范围确定，我们就可以想到再记录$num[i]$表示$n$个数中能到达数字$i$的个数,$ans[i]$则表示到达数字i的最小花费。之后跑$bfs$即可。

代码：

#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <ctime>
#include <string>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
//#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define PB push_back
#define MP make_pair
#define INF 1073741824
#define inf 1152921504606846976
#define pi 3.14159265358979323846
//#pragma comment(linker,"/STACK:10240000,10240000")
//mt19937 rand_(time(0));
const int N=3e5+7,M=2e6;
const long long mod=1e9+7;
inline int read(){int ret=0;char ch=getchar();bool f=1;for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');for(;isdigit(ch);ch=getchar()) ret=(ret<<1)+(ret<<3)+ch-48;return f?ret:-ret;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}//逆元
int head[N],NEXT[M],ver[M],tot;void link(int u,int v){ver[++tot]=v;NEXT[tot]=head[u];head[u]=tot;}


int a[N],num[N],ans[N];
queue<pair<pair<int,int>,int> >q;
void bfs(){
    while(!q.empty()){
        int x=q.front().first.first;
        int pre=q.front().first.second;
        int step=q.front().second;
        q.pop();
        num[x]++;
        ans[x]+=step;
        if(x*2<=200000&&x*2!=pre) q.push(MP(MP(x*2,x),step+1));
        if(x/2>0&&x/2!=x&&x/2!=pre) q.push(MP(MP(x/2,x),step+1));
    }
}
int main(){
    //freopen("1.txt","r",stdin);
    //ios::sync_with_stdio(false);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        q.push(MP(MP(a[i],0),0));
    }
    bfs();
    int minn=INF;
    for(int i=1;i<=200000;i++){
        if(num[i]==n)
            minn=min(minn,ans[i]);
    }
    printf("%d\n",minn);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}