汉明距离相关应用

#include <bits/stdc++.h>
#define umap unordered_map
#define vint vector<int>
#define ll long long
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define ull unsigned long long
#define uint unsigned int
#define rg register
#define il inline
#define db double
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define sqr(x) ((x)*(x))
using namespace std;
const int INF=0x3f3f3f3f,mod=1e9+7;
const long long INFL=0x3f3f3f3f3f3f3f3f;
const double eps=1e-8;
il int read(){
    int w=0,f=1;
    char ch=getchar();
    while(ch<'0'||ch>'9'){
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9'){
        w=(w<<1)+(w<<3)+(ch^48);
        ch=getchar();
    }
    return w*f;
}
il void chkmax(int &x,int y){x=(x<y)?y:x;}
il void chkmin(int &x,int y){x=(x>y)?y:x;}

const int N=1e5+10,V=18;
int a[N],dis[(1<<V)+10],vis[(1<<V)+10];
int n,c;
int main(){
    #ifndef ONLINE_JUDGE
    //freopen("in.txt","r",stdin);
    #endif
    cin>>c>>n;
    queue<int> Q;
    memset(dis,0x3f,sizeof(dis));
    rep(i,1,n){
        char ch;
        int x=0,y=0;
        rep(j,1,c){
            cin>>ch;
            x=(x<<1)+(ch=='G'),y=(y<<1)+(ch=='H');
        }
        a[i]=x;
        dis[y]=0,Q.push(y);
    }
    while(!Q.empty()){
        int u=Q.front();Q.pop();
        if(vis[u]) continue;
        vis[u]=1;
        for(int i=0;i<c;++i){
            int v=u^(1<<i);
            if(dis[v]>dis[u]+1){
                dis[v]=dis[u]+1;
                Q.push(v);
            }
        }
    }
    rep(i,1,n){
        cout<<c-dis[a[i]]<<"\n";
    }
    #ifndef ONLINE_JUDGE
    fprintf(stderr,"%f\n",1.0*clock()/CLOCKS_PER_SEC);
    #endif
    return 0;
}