zoukankan      html  css  js  c++  java
  • POJ 1308 Is It A Tree? (并查集)

    Is It A Tree?
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 24237   Accepted: 8311

    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.




    和HDU 1272一模一样,除了改下输出其他什么都不用改。
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <string>
     4 #include <queue>
     5 #include <vector>
     6 #include <map>
     7 #include <algorithm>
     8 #include <cstring>
     9 #include <cctype>
    10 #include <cstdlib>
    11 #include <cmath>
    12 #include <ctime>
    13 using    namespace    std;
    14 
    15 const    int    SIZE = 100005;
    16 int    FATHER[SIZE],RANK[SIZE];
    17 vector<int>    S;
    18 
    19 void    ini(int);
    20 int    find_father(int);
    21 bool    unite(int,int);
    22 bool    same(int,int);
    23 int    main(void)
    24 {
    25     int    a,b,count = 0;
    26     bool    flag;
    27 
    28     while(scanf("%d%d",&a,&b) && (a != -1 && b != -1))
    29     {
    30         flag = true;
    31         if(a == 0 && b == 0)
    32         {
    33             printf("Case %d %s
    ",++ count,flag ? "is a tree." : "is not a tree.");
    34             continue;
    35         }
    36         S.clear();
    37         S.push_back(a);
    38         S.push_back(b);
    39         ini(SIZE - 2);
    40         flag = unite(a,b);
    41         while(scanf("%d%d",&a,&b) && (a || b))
    42         {
    43             flag &= unite(a,b);
    44             S.push_back(a);
    45             S.push_back(b);
    46         }
    47         for(int i = 1;i < S.size();i ++)
    48             flag &= same(S[0],S[i]);
    49         printf("Case %d %s
    ",++ count,flag ? "is a tree." : "is not a tree.");
    50     }
    51 
    52     return    0;
    53 }
    54 
    55 void    ini(int n)
    56 {
    57     for(int i = 1;i <= n;i ++)
    58     {
    59         FATHER[i] = i;
    60         RANK[i] = 0;
    61     }
    62 }
    63 
    64 int    find_father(int n)
    65 {
    66     if(n == FATHER[n])
    67         return    n;
    68     return    FATHER[n] = find_father(FATHER[n]);
    69 }
    70 
    71 bool    unite(int x,int y)
    72 {
    73     x = find_father(x);
    74     y = find_father(y);
    75 
    76     if(x == y)
    77         return    false;
    78     if(RANK[x] < RANK[y])
    79         FATHER[x] = y;
    80     else
    81     {
    82         FATHER[y] = x;
    83         if(RANK[x] == RANK[y])
    84             RANK[x] ++;
    85     }
    86     return    true;
    87 }
    88 
    89 bool    same(int x,int y)
    90 {
    91     return    find_father(x) == find_father(y);
    92 }
  • 相关阅读:
    [C语言] 交换排序之冒泡排序的特性及实现
    [C语言] 选择排序之鸡尾酒排序的特性及实现
    [C语言] 选择排序之直接选择排序的特性及实现
    计蒜客 蓝桥杯模拟 快速过河
    计蒜客 蓝桥杯模拟 瞬间移动 dp
    计蒜客 蓝桥杯模拟 充话费
    计蒜客 蓝桥杯模拟二 区间合并 打扫教室
    商品类目短文本分类总结
    SpringBoot项目创建及入门基础
    Joyful HDU
  • 原文地址:https://www.cnblogs.com/xz816111/p/4530407.html
Copyright © 2011-2022 走看看