Source: 2017 ACM-ICPC 亚洲区(西安赛区)网络赛
Problem:
∙
一棵树,
n
个结点各有一个值
∙
类似于
HDU5840
,但是求的是这条路径上的最大值,而异或值可以通过前缀来维护,比较方便。
Idea:
∙
small−big
分块+树上倍增。
∙
较大的
k
通过倍增暴力往上跳,复杂度是
∙
较小的
k
通过预处理
∙
所以
divk
取
n√
Code:
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define CLR(A, X) memset(A, X, sizeof(A))
#define bitcount(X) __builtin_popcountll(X)
typedef long long LL;
typedef pair<int, int> PII;
const double eps = 1e-10;
const int MOD = 255;
const LL INF = 1e18;
int dcmp(double x) { if(fabs(x) < eps) return 0; return x<0?-1:1; }
int BL;
const int MAXN = 5e4+5;
int a[MAXN], p[MAXN][25], dep[MAXN], dp[MAXN][255];
vector<int> G[MAXN];
void init(int n) {
p[1][0] = 0; dep[1] = 1; BL = sqrt(n+0.5);
for(int i = 1; i <= n; i++) G[i].clear();
}
int Find(int u, int k) {
for(int i = 0; (1<<i) <= k; i++) {
if((1<<i)&k) u = p[u][i];
if(u == 0) return u;
}
return u;
}
void dfs(int u, int fa) {
for(int i = 1; i <= 20; i++) {
p[u][i] = p[p[u][i-1]][i-1];
}
for(int i = 1; i <= BL; i++) {
dp[u][i] = a[u];
dp[u][i] ^= dp[Find(u, i)][i];
}
for(int v:G[u]) if(v != fa) {
p[v][0] = u;
dep[v] = dep[u]+1;
dfs(v, u);
}
}
int lca(int u, int v) {
if(dep[u] < dep[v]) swap(u, v);
u = Find(u, dep[u]-dep[v]);
if(u == v) return u;
for(int i = 20; i >= 0; i--) {
if(p[u][i] != p[v][i]) u = p[u][i], v = p[v][i];
}
return p[u][0];
}
int smallcase(int u, int v, int k, int fa) {
int t = dep[u]-dep[fa];
t = t-t%k;
int ret = dp[u][k]^dp[Find(u, t+k)][k];
t = dep[v]+dep[u]-2*dep[fa];
v = Find(v, t%k);
if(dep[v] < dep[fa]) return ret;
t = dep[v]-dep[fa];
t = t-t%k;
u = Find(v, t);
ret ^= dp[v][k]^dp[u][k];
if(u != fa) ret ^= a[u];
return ret;
}
int bigcase(int u, int v, int k, int fa) {
int t = dep[v]+dep[u]-2*dep[fa];
v = Find(v, t%k);
int ret = 0;
while(dep[u] >= dep[fa]) {
ret ^= a[u];
u = Find(u, k);
}
while(dep[v] > dep[fa]) {
ret ^= a[v];
v = Find(v, k);
}
return ret;
}
int main() {
int n, q, u, v, k;
while(~scanf("%d%d", &n, &q)) {
init(n);
for(int i = 1; i < n; i++) {
scanf("%d%d", &u, &v);
G[u].pb(v); G[v].pb(u);
}
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
dfs(1, -1);
while(q--) {
scanf("%d%d%d", &u, &v, &k);
int fa = lca(u, v);
if(k > BL) printf("%d\n", bigcase(u, v, k, fa));
else printf("%d\n", smallcase(u, v, k, fa));
}
}
return 0;
}