题意:
给定N≤105的一棵树,边权只有0或1,求每个点最近点(包括自己)个数的异或和
分析:
最近点显然是距离为0,直接无视1建图,搜出连通块异或就可以了
考虑异或的性质,异或奇数大小的就可以了
坑:
HDU windows 栈大小真牛逼 7W个点让我RE被叉了,模版不开栈不行啊
代码:
//
// Created by TaoSama on 2016-01-02
// Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
using namespace std;
#define pr(x) cout << #x << " = " << x << " "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n;
vector<int> G[N];
bool vis[N];
vector<int> p;
int dfs(int u) {
vis[u] = true;
int ret = 1;
for(int i = 0; i < G[u].size(); ++i) {
int v = G[u][i];
if(vis[v]) continue;
ret += dfs(v);
}
return ret;
}
int main() {
#ifdef LOCAL
freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
// freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
int t; scanf("%d", &t);
while(t--) {
scanf("%d", &n);
for(int i = 1; i <= n; ++i) G[i].clear();
for(int i = 1; i < n; ++i) {
int u, v, c; scanf("%d%d%d", &u, &v, &c);
if(c) continue;
G[u].push_back(v);
G[v].push_back(u);
}
int ans = 0;
memset(vis, false, sizeof vis);
for(int i = 1; i <= n; ++i) {
if(vis[i]) continue;
int cnt = dfs(i);
if(cnt & 1) ans ^= cnt;
}
printf("%d\n", ans);
}
return 0;
}