题目描述
给出若干个数,数字转成2^64次方后,两个数只当在二进制下仅有三位不同时,这两个数才可以称为互相匹配,现在给出n次给数,要求每次给数后输出当前数列中的总匹配数
样例输入
10
9404036463553923040
9404038696936916704
1521386814669494545
12183328314988946679
1169534990708571684
11565766518074758880
10744750057578731793
15981146932063590331
7656317005723312435
1333447427200632544
样例输出
0
1
0
0
0
1
1
0
0
1
思路
因为数据随机,所以均匀分布
把数分成四段,那么必然有一段完全相同,找出这段然后暴力匹配这两个数就好了
代码
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define ll unsigned long long
using namespace std;
struct node {
int to, next;
}g[600001];
int n, ans, h[5][70001], a[150001], t;
ll x[150001];
void add1(ll x, int y) {
g[++t] = (node){y, h[1][x]}; h[1][x] = t;
}
void add2(ll x, int y) {
g[++t] = (node){y, h[2][x]}; h[2][x] = t;
}
void add3(ll x, int y) {
g[++t] = (node){y, h[3][x]}; h[3][x] = t;
}
void add4(ll x, int y) {
g[++t] = (node){y, h[4][x]}; h[4][x] = t;
}
bool work(int xx, int y)
{
int num = 0;
for(int i = 0; i < 64; ++i)
if(((x[xx] >> i) & 1) ^ ((x[y] >> i) & 1)) num++;
return num == 3;
}//匹配是否有三位不同
int main()
{
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
{
scanf("%llud", &x[i]);
ans = 0;
a[0] = 0;
int xx = x[i] % (1ll << 16);
for(int j = h[1][xx]; j; j = g[j].next)
a[++a[0]] = g[j].to;
add1(xx, i);
xx = (x[i] >> 16) % (1ll << 16);
for(int j = h[2][xx]; j; j = g[j].next)
a[++a[0]] = g[j].to;
add2(xx, i);
xx = (x[i] >> 32) % (1ll << 16);
for(int j = h[3][xx]; j; j = g[j].next)
a[++a[0]] = g[j].to;
add3(xx, i);
xx = x[i] >> 48;
for(int j = h[4][xx]; j; j = g[j].next)
a[++a[0]] = g[j].to;
add4(xx, i);//分别比较四段
sort(a + 1, a + a[0] + 1);
a[0] = unique(a + 1, a + a[0] + 1) - a - 1;//去重
for(int j = 1; j <= a[0]; ++j)
if(work(a[j], i)) ans++;
printf("%d\n", ans);
}
return 0;
}