Description

1） 当前的话与前面的某些真的话冲突，就是假话；
2） 当前的话中X或Y比N大，就是假话；
3） 当前的话表示X吃X，就是假话。

Input

Output

Sample Input

100 7 1 101 1 2 1 2 2 2 3 2 3 3 1 1 3 2 3 1 1 5 5

Sample Output

3

``````/*
* 所以设出来的并查集有三个根,这三个是划分块,不能同时成立,
* 每个划分块里面是等价类,一个成立则其他都成立
*/
import java.util.Scanner;

public class shiwulian {
private static int N, K;
private static final int MAX_K = 100001;
private static final int MAX_N = 50001;
private static int[] T = new int[MAX_K];
private static int[] X = new int[MAX_K];
private static int[] Y = new int[MAX_K];
private static int[] parent = new int[MAX_N];
private static int[] height = new int[MAX_N];

public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
N = cin.nextInt();
K = cin.nextInt();
for (int i = 1; i <= K; ++i) {
T[i] = cin.nextInt();
X[i] = cin.nextInt();
Y[i] = cin.nextInt();
}
cin.close();
solve();
}

public static void init(int n) {
for (int i = 1; i <= n; ++i) {
parent[i] = i;
height[i] = 1;
}
}

public static int find(int p) { // 查找根节点
int root = p;
while (root != parent[root]) {// 到这里为加权quick-union算法，往下继续优化
root = parent[root];
}
while (p != root) {// 直接把查找过的结点直接连到根节点，路径压缩
int newp = parent[p];
parent[p] = root;
p = newp;
}
return root;
}

public static boolean same(int x, int y) {
return find(x) == find(y);
}

public static void unite(int x, int y) {
if (x == y)
return;
if (height[x] < height[y]) {
parent[x] = y;
height[y] += height[x];
} else {
parent[y] = x;
height[x] += height[y];
}
}

public static void solve() {
init(N * 3);
int ans = 0;
for (int i = 1; i <= K; ++i) {
int t = T[i];
int x = X[i], y = Y[i];

if (x < 1 || x > N || y < 1 || x > N) {
++ans;
continue;
}

if (t == 1) { // 同类
if (same(x, y + N) || same(x, y + 2 * N)) {
++ans;
continue;
} else { // 把ABC类的xy都连在一起
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;
continue;
} else {
unite(x, y + N); // x吃y，y是B类
unite(x + N, y + 2 * N); // x吃y,x是B类,y是C类
unite(x + 2 * N, y); // x吃y,x是C类，y是A类
}
}
}
System.out.println(ans);
}
}``````

========================================Talk is cheap, show me the code=======================================