hdu6851 Heart

题目链接

前置知识

最暴力的做法就是拿每个danmaku去做一次卷积。
但要求$i\&j=0$，那么二进制最高位相同的一类必然不会相互影响，那么将所有danmaku分成21类来做21次卷积就能预处理出所有情况，然后$O(1)$回答。
直接拿了std的模板用…

#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1 << 21;
#define fi first
#define se second
#define pb push_back
#define wzh(x) cerr<<#x<<'='<<x<<endl;
int n;
const int mod = 998244353;
int Base = 21;
int add(int x) {
	if (x >= mod)x -= mod;
	if (x < 0)x += mod;
	return x;
}
int mul(int x, int y) {
	return 1ll * x * y % mod;
}
inline void fmt_or(vector<int>& A, int dmt = 1, int base = Base) {
	int len = 1 << base;
	for (int i = 1; i < len; i <<= 1)
		for (int j = 0, t = i << 1; j < len; j += t)
			for (int k = j, K = j + i; k < K; ++k) A[k + i] = add(A[k + i] + dmt * A[k]);
}
vector<int> pc;
void get_top(int sz) {
	pc.resize(sz, 0);
	for (int i = 1; i < sz; ++i) pc[i] = pc[i >> 1] + (i & 1);
}
vector<int> subset_conv(vector<int> &A, vector<int>&B, int base) {
	int len = 1 << base;
	vector<int> H(len);
	vector<vector<int> > siga(base + 1, vector<int>(len, 0)), sigb = siga, sigh = siga;
	for (int S = 0; S < len; ++S) siga[pc[S]][S] = A[S], sigb[pc[S]][S] = B[S];
	for (int i = 0; i <= base; ++i) {
		fmt_or(siga[i], 1, base);
		fmt_or(sigb[i], 1, base);
		for (int S = 0; S < len; ++S)
			for (int j = 0; j <= i; ++j) sigh[i][S] = add(sigh[i][S] + mul(siga[j][S], sigb[i - j][S]));
		fmt_or(sigh[i], -1, base);
	}
	for (int S = 0; S < len; ++S) H[S] = sigh[pc[S]][S];
	return H;
}
int main() {
	scanf("%d", &n); pc.resize(1 << Base);
	vector<int>res(1 << Base, 0); get_top(1 << Base);
	for (int i = 1; i <= n; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		res[y] = add(res[y] + x);
	}
	vector<int>ans(1 << Base, 0);
	ans[0] = 1;
	for (int i = 0; i < 21; i++) {
		int sz = 1 << i;
		auto A = vector<int>(ans.begin(), ans.begin() + sz);
		auto B = vector<int>(res.begin() + sz, res.begin() + 2 * sz);
		A = subset_conv(A, B, i);//A B 子集卷积  
		for (int j = sz; j < 2 * sz; j++) {
			ans[j] = A[j - sz];
		}
	}
	int t, x;
	for (scanf("%d", &t); t; t--) {
		scanf("%d", &x);
		printf("%d\n", ans[x]);
	}
	return 0;
}