树的判定----并查集

题目链接：http://acm.nyist.net/JudgeOnline/problem.php?pid=129

#include<stdio.h>

#include<string.h>
#include<algorithm>
const int MAXN = 10005;
int key[MAXN];
int pre[MAXN];
int find(int x) {
return pre[x]==x?x:find(pre[x]);
}
int main() {
int m, n, cnt, sum;
bool flag;
for(int i = 1; i < MAXN; i++) {
pre[i] = i;
key[i] = 0;
}
flag = true;
cnt = sum = 0;
while(scanf("%d%d", &m, &n)) {
if(m == -1 && n == -1) {
break;
}
if(m == 0 && n == 0) {
if(flag) {
for(int i = 1; i < MAXN; i++) {
if(key[i] == 0) continue;
if(pre[i] == i) sum++;
}
if(sum > 1) flag = false;
}
if(flag) printf("Case %d is a tree.\n", ++cnt);
else printf("Case %d is not a tree.\n", ++cnt);
for(int i = 1; i < MAXN; i++) {
pre[i] = i;
key[i] = 0;
}
flag = true; sum = 0;
continue; 
}
if(flag) {
int x = find(m);
int y = find(n);
key[m] = key[n] = 1;
if(x == y) {  //包含两种情况：1.pre[m]=n，逆转则非树；2.m和n已经在同一个子树 
flag = false;
} else {
if(pre[n] == n) pre[n] = x;
else flag = false;
} 
}
}
return 0;
}