并查集判树 hdoj 1325 Is it a tree?

题目传送门：http://acm.hdu.edu.cn/showproblem.php?pid=1325

给出若干条有向边的始点和终点，判断是否是一棵树。并查集合并时判断是否属于一个联通分量，一个点的入度不能大于1，有且只有一个点入度为0.

#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
const int MAX = 100005;
int father[MAX];
int find(int x)
{
    while (x != father[x]) {
        father[x] = father[father[x]];
        x = father[x];
    }
    return x;
}
void unite(int a, int b)
{
    a = find(a);
    b = find(b);
    father[a] = b;
    return ;
}
int main()
{
    int x,y,visit[MAX],tc = 0,degree[MAX];
    while (scanf("%d%d",&x,&y), x >= 0 && y >= 0) {
        for (int i = 1; i <= 100000; i ++) {
            father[i] = i;
        }
        memset(visit,0,sizeof(visit));
        memset(degree,0,sizeof(degree));
        if (x && y) {
            unite(x, y);
            degree[y] ++;
            visit[x] = visit[y] = 1;
        } else {
            printf("Case %d is a tree.\n",++ tc);
            continue;
        }
        int flag = 1;
        while (scanf("%d%d",&x,&y), x || y) {
            visit[x] = visit[y] = 1;
            degree[y] ++;
            int xx = find(x);
            int yy = find(y);
            if (flag) {
                if (xx == yy) {
                    flag = 0;
                } else {
                    unite(x,y);
                }
                if (degree[y] > 1) {
                    flag = 0;
                }        
            }
        }
        int cnt = 0;
        if (flag) {
            for (int i = 1; i <= 100000; i ++) {
                if (visit[i] && i == father[i]) {
                    cnt ++;
                }
            }
            if (cnt != 1) {
                flag = 0;
            }
        } 
        if (flag) {
            printf("Case %d is a tree.\n",++ tc);
        } else {
            printf("Case %d is not a tree.\n",++ tc);
        }
    }
    return 0;
}