zoukankan      html  css  js  c++  java
  • 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.



    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.


    InputThe 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.
    OutputFor 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.

    代码:
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 using namespace std;
     5 int f[100005];
     6 int main()
     7 {
     8     int a,b,flag,i,j;
     9     int t=1;
    10     while(1)
    11     {
    12         j=0;
    13         i=0;
    14         flag=0;
    15         memset(f,0,sizeof(f));
    16         while(scanf("%d%d",&a,&b)&&a&&b)
    17         {
    18             if(a<0||b<0)
    19                 return 0;
    20             if(f[b]-1==1)
    21                 flag=1;
    22             if(f[a]==0)
    23                 j++;
    24             if(f[b]==0)
    25                 j++;
    26             f[a]=1;
    27             f[b]=2;
    28             i++;
    29         }
    30         if(flag==0&&j==i+1)
    31             printf("Case %d is a tree.
    ",t++);
    32         else
    33             printf("Case %d is not a tree.
    ",t++);
    34     }
    35 }
    不太懂,看看代码就得了
    
    
    

  • 相关阅读:
    网友心得 说说.NET中的反射(转帖)
    javascript的函数(转)
    asp.net基于窗体的身份验证
    创建ASP.NET WEB自定义控件(转)
    .net调用Oracle存储过程
    写字间里程序员
    世界四大杀毒软件调侃
    技巧/诀窍:在ASP.NET中重写URL(转)
    VS2008中JavaScript编辑调试器的秘密
    如何用C#语言构造蜘蛛程序
  • 原文地址:https://www.cnblogs.com/She-Chuan/p/9503852.html
Copyright © 2011-2022 走看看