POJ1733 Parity game 带权并查集

题目链接

http://poj.org/problem?id=1733

分析

若 $(l,r)$ 结果为奇数，说明前缀和 $sum[r]$ 和 $sum[l-1]$ 奇偶性相反；

反之则说明二者奇偶性相同；

用并查集的节点表示每个位置的前缀和，维护每个节点与父亲的异或和即可。

AC代码

#include <cstdio>
#include <algorithm>

using namespace std;

inline int read() {
	int num = 0;
	char c = getchar();
	while (c < '0' || c > '9') c = getchar();
	while (c >= '0' && c <= '9')
		num = num * 10 + c - '0', c = getchar();
	return num;
}

const int maxn = 5e3 + 5;

struct Query {
	int l, r, ans;
} q[maxn];

int a[2 * maxn], f[2 * maxn], d[2 * maxn];

int find(int x) {
	if (x == f[x]) return x;
	int root = find(f[x]);
	d[x] ^= d[f[x]];
	return f[x] = root;
}

inline void merge(int x, int y, int z) {
	int d1 = d[x], d2 = d[y];
	x = find(x), y = find(y);
	f[x] = y, d[x] = d1 ^ d2 ^ z;
}

int main() {
	int n = read(), m = read();
	char oe[5];
	for (int i = 1; i <= m; ++i) {
		q[i].l = a[i] = read() - 1, q[i].r = a[i + m] = read();
		scanf("%s", oe);
		q[i].ans = oe[0] == 'o' ? 1 : 0;
	}
	sort(a + 1, a + 2 * m + 1);
	n = unique(a + 1, a + 2 * m + 1) - a - 1;
	for (int i = 1; i <= m; ++i) {
		q[i].l = lower_bound(a + 1, a + n + 1, q[i].l) - a;
		q[i].r = lower_bound(a + 1, a + n + 1, q[i].r) - a;
	}
	for (int i = 1; i <= 2 * m; ++i) f[i] = i;
	for (int i = 1; i <= m; ++i) {
		int x = q[i].l, y = q[i].r, z = q[i].ans;
		if (find(x) == find(y) && (d[x] ^ d[y]) != z) {
			printf("%d", i - 1);
			return 0;
		}
		else if (find(x) != find(y)) merge(x, y, z);
	}
	printf("%d", m);
	return 0;
}