和与或(有点不一样的数位dp?)

思路:

注意到,每一位只能选至多一个1.加上每一位r[i]的限制,联想到数位dp.设f[pos][lim]为当前的数位为pos,lim是大小为(1 << n)的状压,分别表示每一位是否被限制选择,与普通的数位dp相似.

代码:

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
#define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f 
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int MOD = 1e9 + 9;
int n, r[20], f[80][1 << 12];
//f[pos][lim]表示当前填到第pos位,对r[i]的限制为lim,0表示限制,1表示不限制
int dfs(int pos, int lim) {
	if (pos < 0) return 1;
	if (f[pos][lim] != -1) return f[pos][lim];
	int state = 0, ans = 0;
//因为是从高位讨论到低位,所以高位为1,那么低位的也会解限
	for (int i = 1; i <= n; ++i) if (r[i] >> pos & 1) state |= (1ll << i);
	ans += dfs(pos - 1, lim | state);
	for (int i = 1; i <= n; ++i) {
//如果之前就已经解限,那么下一位也一定解限
		if (lim >> i & 1) ans += dfs(pos - 1, lim | state);
//如果这一位才解限,下一位仍然保持这一位的限制
		else if (state >> i & 1) ans += dfs(pos - 1, (lim | state) ^ (1ll << i));
//如果存在限制,则不能放1
	}
	return f[pos][lim] = ans % MOD;
}
signed main() {
	qio >> n;
	for (int i = 1; i <= n; ++i) qio >> r[i];
	mem(f, -1);
	qio << dfs(62, 0);
}