牛客网 Is It a tree？（并查集）

题目传送门

Is It a tree？

题目描述

A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties. There is exactly one node, called the root, to which no directed edges point. Every node except the root has exactly one edge pointing to it. There is a unique sequence of directed edges from the root to each node. For example, consider the illustrations below, in which nodes are represented by circles and edges are represented by lines with arrowheads. The first two of these are trees, but the last is not.

输入描述:

The input will consist of a sequence of descriptions (test cases) followed by a pair of negative integers. Each test case will consist of a sequence of edge descriptions followed by a pair of zeroes Each edge description will consist of a pair of integers; the first integer identifies the node from which the edge begins, and the second integer identifies the node to which the edge is directed. Node numbers will always be greater than zero and less than 10000.

输出描述:

For each test case display the line “Case k is a tree.” or the line “Case k is not a tree.”, where k corresponds to the test case number (they are sequentially numbered starting with 1).

输入

6 8  5 3  5 2  6 4
5 6  0 0

8 1  7 3  6 2  8 9  7 5
7 4  7 8  7 6  0 0

3 8  6 8  6 4
5 3  5 6  5 2  0 0

-1 -1

输出

Case 1 is a tree.
Case 2 is a tree.
Case 3 is not a tree.

思路

并查集，设输入的两个点为p1，p2，则p1是p2的父亲，考虑不为树的情况就有：

• 两个父亲同时指向了一个孩子，假设输入数据为（1，2）（3，2），那么对于最后一组输入数据（3，2）来说，$father[2]=1\ne 2(father[p2]\ne p2)$，则表示节点2已经作为子节点在树中
• 当前的图是一个环：
  • 1→1 ($p1=p2$)
  • 1→2，2→3，3→1，假设输入为（1，2）（2，3）（3，1），那么对于最后一组输入数据（3，1）来说 $father[3]=1（father[p1]=p2）$
• 连通量不为1时不是树，例：（1，2）（7，8）

注意

没有点的时候也算是树，也就是只输入（0，0）的时候要输出 is a tree

代码

#include <bits/stdc++.h>
using namespace std;
#define MAXN 10005
int fa[MAXN];
int flag;
set<int> myset;
set<int> points;
void init(){
    for (int i=1;i<MAXN;i++){
        fa[i]=i;
    }
    flag=1;
    myset.clear();
    points.clear();
}
int getf(int x){
    return x==fa[x]?x:fa[x]=getf(fa[x]);
}
void setf(int x,int y){
    int fx=getf(x);
    int fy=getf(y);
    fa[fx]=fy;
}

int main (){
    int x,y,cases=0;
    init();
    while (scanf("%d%d",&x,&y)!=EOF){
        if (x==-1 && y==-1)break;
        if (x && y){
            points.insert(x);
            points.insert(y);
            int fy=getf(y);
            if (fy!=y || x==y || getf(x)==y){
                //不为树的情况1和2
                flag=0;
            }
            setf(y,x);
        }else if (!x && !y){
            set<int>::iterator iter=points.begin();
            while (iter!=points.end()){
                int t=*iter;
                getf(t);
                myset.insert(getf(t));
                iter++;
            }
            //不为树的情况3
            if (myset.size()!=1){
                flag=0;
            }
            //没有点也是树
            if (points.size()==0){
                flag=1;
            }
            if (flag){
                printf("Case %d is a tree.\n",++cases);
            }else {
                printf("Case %d is not a tree.\n",++cases);
            }
            init();
        }
    }
    return 0;
}