P2024 [NOI2001] 食物链(并查集)

nullhttps://www.luogu.com.cn/problem/P2024

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)


int pre[MAXN];
void init(int n) {
	for (int i = 1; i <= n; i++) {
		pre[i] = i;
	}
	return;
}

int find(int x) {
	if (pre[x] == x) {
		return x;
	}
	return pre[x] = find(pre[x]);
}

void unite(int x, int y) {
	x = find(x);
	y = find(y);
	pre[x] = y;
}

inline bool same(int x, int y) {
	return find(x) == find(y);
}

int main() {
	int n, k;
	scanf("%d %d", &n, &k);
	init(3 * n);
	int t, x, y;
	int ans = 0;
	while (k--) {
		scanf("%d %d %d", &t, &x, &y);
		if (x > n || y > n || x < 0 || y < 0) {
			ans++;
			continue;
		}
		if (t == 1) {
			if (same(x, y + n) || same(x, y + 2 * n)) {
				ans++;
			} else {
				unite(x, y);
				unite(x + n, y + n);
				unite(x + 2 * n, y + 2 * n);
			}
		} else if (t == 2) {
			if (same(x, y) || same(x, y + 2 * n)) {
				ans++;
			} else {
				unite(x, y + n);
				unite(x + n, y + 2 * n);
				unite(x + 2 * n, y);
			}
		}
	}
	printf("%d", ans);
	return 0;
}