给n个二进制串,x与y的距离是二进制上不同的位数。
求距离这n个二进制串最近距离最远的二进制串。
n<=1e5,二进制串长度<=20
做法:
建图,共有2^20个点,对于一个点来说,最多有20条边与之相连,边为双向边且边权为1。把起始点扔进队列,然后多源bfs,求深度最深的点。
#include <bits/stdc++.h>
#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 ll long long
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(),(x).end()
using namespace std;
const int mod = 1e9+7;
const int N = 2e6+1000;
int n,m;
bitset<20> s[N];
bool vis[N];
int deep[N];
void bfs() {
queue<int> q;
rep(i, 1, n) {
int x = s[i].to_ulong();
q.push(x);
vis[x] = 1;
}
while(!q.empty()) {
int u = q.front();
q.pop();
bitset<20> x(u);
rep(i, 0, m-1) {
x.flip(i);
int v = x.to_ulong();
if(!vis[v]) {
vis[v] = 1;
deep[v] = deep[u]+1;
q.push(v);
}
x.flip(i);
}
}
}
int main() {
ios::sync_with_stdio(0);
cin>>n>>m;
rep(i, 1, n) {
string x;
cin>>x;
rep(j, 0, m-1)
s[i][j] = x[m-j-1]-'0';
}
bfs();
int ans = 0;
rep(i, 0, 1048576) if(deep[i]>deep[ans]) ans = i;
bitset<20> k(ans);
per(i, m-1, 0)
cout<<k[i];
return 0;
}