HDU1325 并查集

原创 2016年06月02日 00:18:05

Is It A Tree?

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20573    Accepted Submission(s): 4669


Problem Description
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.



In this problem you will be given several descriptions of collections of nodes connected by directed edges. For each of these you are to determine if the collection satisfies the definition of a tree or not.

 

Input
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.
 

Output
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).
 

Sample Input
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
 

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


判断能否形成一棵树,首先不能有环,这个跟小希的迷宫那个有点像,然后根节点的f值为他自己,只能有一个根节点,也就是f[i]=i的点只能有一个,然后除了根节点所有节点的入度为1,根节点入度为0

代码这里写的比较详细。http://www.cnblogs.com/newpanderking/archive/2012/10/14/2723260.html

#include <stdio.h>

const int max_num = 100000+10;
typedef struct
{
    int num,root,conn;//数据、根、入度
}Node;

Node node[max_num];

void init()
{
    for(int i = 0; i < max_num; i++)
    {
        node[i].conn = 0;//入度初始化为0
        node[i].root= i;//根记录为自身
        node[i].num=0;//标记数字是否被使用过,0:没有被使用过,1:使用过了
    }
}

int find_root(int a)
{
    if(node[a].root!=a)
        return node[a].root = find_root(node[a].root);
    return node[a].root;
}

void union_set(int a,int b)
{
    a = find_root(a);
    b = find_root(b);
    if(a==b)//同一个根,说明是在同一个树下
    return;
    node[b].root=a;//把b的根赋为a的根,此时a已经是根,num==root
}

int main()
{
    int n,m;
    int i = 1;
    bool flag=true;//true:是个树,false:不是树
    init();
    while(scanf("%d%d",&n,&m)!=EOF&&n>=0&&m>=0)
    {
        if(!flag&&n!=0&&n!=0)continue;//已经确定不是树了,就继续循环
        if(n==0&&m==0)
        {
            int root_num=0;
            for(int j = 1; j < max_num;j++)
            {
                //判断是否为森林,如果,root_num用来记录根的数目
                if(node[j].num && find_root(j)==j)
                root_num++;
                if(node[j].conn>1)//如果出现某个节点的入度超过1,不是树
                {
                    flag = false;
                    break;
                }
            }
            if(root_num>1)//连通分支大于1,是森林不是树
                flag=false;
            if(flag)
            printf("Case %d is a tree.\n",i++);
            else printf("Case %d is not a tree.\n",i++);
            flag = true;
            init();
            continue;
        }
        if(m!=n&&find_root(n)==find_root(m))
        flag = false;
        else
        {
            //将m,n,记录为节点
            node[m].num = 1;
            node[n].num = 1;
            node[m].conn++;//入度增加一
            union_set(n,m);
        }
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

hdu1325 hdu1272 hdu1232 并查集应用

并查集,顾名思义,分为并和查两个操作

并查集 HDU1325-Is It A Tree?

并查集 HDU1325-Is It A Tree?

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

HDU1325 Is It A Tree? 【并查集】

Is It A Tree? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...

HDU1325 Is It A Tree? 并查集

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1325 这题与HDU1272 小希的迷宫 (并查集) 非常像,不过细细看,还是有一点区别的。 就是这题的...

hdu1325 Is It A Tree? (并查集+森林)

Is It A Tree? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...

hdu1325 Is It A Tree?--并查集

原题链接: http://acm.hdu.edu.cn/showproblem.php?pid=1325 一:原题内容 Problem Description A tree ...

hdu1325 Is It A Tree?并查集

hdu1325和另外一道hdu1272.题意基本一致。但是由于数据不同,所以解法也不尽相同。hdu1272可以不使用并查集水过,但这道就必须利用并查集了,用来判断是否是多个树。此外还要判断是否为有环,...

09-07 HDU_Steps5.1 并查集 HDU1829 HDU1325 HDU1598 HDU3461 HDU3635 HDU2473 HDU3172 HDU3038

HDU STEP 5.1 并查集 5.1.1 HDU1829 A Bug's Life 给出异性对a,b 判断是否有冲突,即给出a,b异性,a,c异性,又给出b,c异性,显然是冲突了(同性...

hdu1325 Is It A Tree?(有向图并查集)

本题我相信A不过的好多都是做过小希的迷宫= =,且听我慢慢道来T T 刚开始看,这题基本一样呀,改下输出,果断WA。。。 于是看到是有向图,然后把Union加了个顺序,继续WA。。。 后来看了题...

HDU 1272并查集 开始错的很郁闷 另外HDU1325&&POJ1308

题目:http://acm.hdu.edu.cn/showproblem.php?pid=1272 AC代码: #include #include #include #define maxn...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)