CodeForces 840E. In a Trap

链接：

link

题意：

一棵树，点有点权$a_i$，每次查询$u$到$v$路径上的$max(a_i\,xor\,dis(i, v))$，保证$u$是$v$的祖先。

题解：

注意到$n$和权值都不大，我们考虑值域分块。
考虑维护一个点$x$向上$256$个点的信息，这样我们后八位在跳的时候不会产生影响。
然后$f_{x, i}$表示$x$向上$256$个点的$max(a_j\,xor\,dis(x, j)\,xor\,(i \times 256))$，然后转移就很方便了。
查询就暴力跳就好了。

代码

#include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;

typedef long long LL;
typedef pair <int, int> pii;

inline int Read()
{
    int x = 0, f = 1, c = getchar();
    for (; !isdigit(c); c = getchar())
        if (c == '-')
            f = -1;
    for (;  isdigit(c); c = getchar())
        x = x * 10 + c - '0';
    return x * f;
}

const int MAXN = 50005;
const int MAXM = 256;

int n, Q, a[MAXN], par[MAXN], anc[MAXN], dep[MAXN], f[MAXN][MAXM];
vector <int> adj[MAXN];

inline void Dfs(int x)
{
    for (auto y : adj[x])
        if (y ^ par[x])
            dep[y] = dep[x] + 1, par[y] = x, Dfs(y);
    if (dep[x] >= MAXM)
    {
        int cur = x;
        for (int i = 0, v; i < MAXM; i ++)
            v = (i ^ a[cur]) >> 8, f[x][v ^ 255] = max(f[x][v ^ 255], 255 << 8 | (i ^ a[cur])), cur = par[cur];
        anc[x] = cur;
        for (int j = 0; j < 8; j ++)
            for (int i = 0; i < MAXM; i ++)
                if (!~f[x][i])
                    if (~f[x][i ^ 1 << j])
                        f[x][i] = f[x][i ^ 1 << j] ^ MAXM << j;
    }
}

int main()
{
#ifdef wxh010910
    freopen("data.in", "r", stdin);
#endif
    mset(f, -1);
    n = Read(); Q = Read();
    for (int i = 1; i <= n; i ++)
        a[i] = Read();
    for (int i = 1, x, y; i < n; i ++)
        x = Read(), y = Read(), adj[x].pb(y), adj[y].pb(x);
    dep[1] = 1;
    Dfs(1);
    while (Q --)
    {
        int u = Read(), v = Read(), ret = 0, l = dep[v] - dep[u] + 1, cur = v;
        for (int i = 0; i < l / MAXM; i ++)
            ret = max(ret, f[cur][i]), cur = anc[cur];
        for (int i = l / MAXM * MAXM; i < l; i ++)
            ret = max(ret, a[cur] ^ i), cur = par[cur];
        printf("%d\n", ret);
    }
}