将树转换成有根数后进行点分治,对于每个重心u而言,v是它的子树,则:
for(int j = 0; j < m; j++) (dp[v][j^val[v]]+=dp[u][j])%=MOD;
递归返回的时候得到:
for(int j = 0; j < m; j++) (dp[u][j]+=dp[v][j])%=MOD;
时间复杂度是O(n*m*logn)
代码:
#include<bits/stdc++.h> using namespace std; const long long MOD = 1e9+7; const int MAXN = 1e3+50; int root, size, m; int sz[MAXN], val[MAXN], b[MAXN]; long long f[MAXN], dp[MAXN][MAXN]; bool done[MAXN]; vector<int> G[MAXN]; void getroot(int u, int fa) { sz[u] = 1, b[u] = 0; for(int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if(done[v] || v==fa) continue; getroot(v, u); sz[u] += sz[v]; b[u] = max(b[u], sz[v]); } b[u] = max(b[u], size-sz[u]); if(b[u] < b[root]) root = u; } void dfs(int u, int fa) { for(int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if(done[v] || v==fa) continue; memset(dp[v], 0, sizeof(dp[v])); for(int j = 0; j < m; j++) (dp[v][j^val[v]]+=dp[u][j])%=MOD; dfs(v, u); for(int j = 0; j < m; j++) (dp[u][j]+=dp[v][j])%=MOD; } } void divide(int u, int fa) { memset(dp[u], 0, sizeof(dp[u])); done[u] = 1, dp[u][val[u]] = 1; dfs(u, fa); for(int i = 0; i < m; i++) (f[i]+=dp[u][i])%=MOD; for(int i = 0; i < G[u].size(); i++) { int v = G[u][i]; if(done[v] || v==fa) continue; size = sz[v]; getroot(v, root=0); divide(root, 0); } } void solve() { int n; cin >> n >> m; for(int i = 1; i <= n; i++) scanf("%d", &val[i]), G[i].clear(); for(int i = 0; i < n-1; i++) { int u, v; scanf("%d%d", &u, &v); G[u].push_back(v); G[v].push_back(u); } memset(done, 0, sizeof(done)); memset(f, 0, sizeof(f)); b[0] = size = n; getroot(1, root=0); divide(root, 0); printf("%lld", f[0]); for(int i = 1; i < m; i++) printf(" %lld", f[i]); printf("\n"); } int main() { int T; cin >> T; while(T--) { solve(); } return 0; }
BC上第一种题解中的dfs序还不会使用,第二种题解中FWT还没有看。
待续。