题目:
分析:
参考博客
代码:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define x first
#define y second
typedef pair<int, int> pii;
const double eps = 1e-8;
const ll mod = 1e9 + 7;
const int maxn = 5e6 + 10;
const int inf = 0x3f3f3f3f;
struct edge
{
int ep, val, nex;
};
struct HashMap
{
int head[maxn], tot;
edge e[maxn * 30];
int mod = 5e6;
void init()
{
mem(head, -1), tot = 0;
}
void add(int x, int y, int val)
{
e[tot] = {y, val, head[x]};
head[x] = tot++;
}
void insert(int x)
{
int now = x % mod;
for(int i = head[now]; ~i; i = e[i].nex)
if(e[i].ep == x)
{
e[i].val++;
return;
}
add(now, x, 1);
}
int get(int x)
{
int now = x % mod;
for(int i = head[now]; ~i; i = e[i].nex)
if(e[i].ep == x)
return e[i].val;
return 0;
}
}ma;
int n, m;
int a[maxn], b[maxn];
map<int, int> cnt;
int main()
{
ma.init();
cin >> n >> m;
for(int i = 1; i <= n; i++) cin >> a[i], cnt[a[i]]++;
for(int i = 0; i < 30; i++)
for(int j = 1; j <= n; j++)
ma.insert((1 << i) ^ a[j]);
ll res = 0;
for(int i = 1; i <= m; i++) cin >> b[i], res -= cnt[b[i]] * 30;
for(int i = 1; i <= m; i++)
for(int j = 0; j < 30; j++)
res += ma.get((1 << j) ^ b[i]);
cout << res / 2 << endl;
}