2017 ICPC Asia Urumqi I. A Possible Tree 带权并查集

最新推荐文章于 2024-09-17 00:32:21 发布

mmk27

最新推荐文章于 2024-09-17 00:32:21 发布

阅读量129

点赞数 1

本文链接：https://blog.csdn.net/mmk27_word/article/details/102409981

版权

题目链接：https://nanti.jisuanke.com/t/40520

题解：因为他们都是联通的且只有唯一路径，所以不用管之前怎么连的，直接按照他给的查询，带权并查集判断即可

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int f[N], r[N];
int n, m;
int fath(int x) {
	if(x == f[x]) return f[x];
	else {
		int fx = f[x];
		int rt = fath(f[x]);
		f[x] = rt;
		r[x] = r[x] ^ r[fx];
		return f[x];
	}
}
int main() {
	int T;
	int flag;
	int x, y, z;
	int xx, yy;
	scanf("%d", &T);
	while(T--) {
		flag = 0;
		scanf("%d %d", &n, &m);
		for(int i = 1; i <= n; i++) f[i] = i, r[i] = 0;
		for(int i = 1; i < n; i++) scanf("%d %d", &x, &y);
		for(int i = 1; i <= m; i++) {
			scanf("%d %d %d", &x, &y, &z);
			xx = fath(x);
			yy = fath(y);
			if(xx == yy) {
				if((r[x] ^ r[y]) != z && !flag) flag = i - 1;
			} else {
				f[xx] = yy;
				r[xx] = (r[x] ^ z ^ r[y]);
			}
		}
		printf("%d\n", flag);
	}
	return 0;
}