[Luogu] 让我们异或吧

https://www.luogu.org/problemnew/show/P2420

异或满足

A ^ B = B ^ A

A ^ A = 0

0 ^ A = A

#include <cstdio>
#include <iostream>

using namespace std;
const int N = 1e5 + 10;

#define yxy getchar()

#define RR freopen("gg.in", "r", stdin)

int n, Ty, now = 1, head[N], A[N];
struct Node{int u, v, w, nxt;} G[N << 1];

inline int read() {
    int x = 0, f = 1; char c = yxy;
    while(c < '0' || c > '9') {if(c == '-') f = -1; c = yxy;}
    while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = yxy;
    return x * f;
}

void Add(int u, int v, int w) {
    G[now].v = v; G[now].w = w; G[now].nxt = head[u]; head[u] = now ++;
}

void Dfs(int u, int fa) {
    for(int i = head[u]; ~ i; i = G[i].nxt) {
        int v = G[i].v;
        if(v != fa) {
            A[v] = G[i].w ^ A[u];
            Dfs(v, u);
        }
    }
}

int main() {
    n = read();
    for(int i = 1; i <= n; i ++) head[i] = -1;
    for(int i = 1; i < n; i ++) {
        int u = read(), v = read(), w = read();
        Add(u, v, w); Add(v, u, w);
    }
    Dfs(1, 0);
    Ty = read();
    while(Ty --) {
        int u = read(), v = read();
        cout << (A[u] ^ A[v]) << endl;
    }
    
    
    return  0;
}

 

转载于:https://www.cnblogs.com/shandongs1/p/8435417.html