• hdu1325 Is It A Tree? solution


    question:

    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.
    题意: 考查的是并查集和有向树,套用模板
    #include<cstdio>
    #include<cstring>
    using namespace std;
    int parent[1010];
    int mm[1010];
    int flag;
    int find_root(int x){
        while(parent[x]!=x){
            int r=parent[x];
            parent[x]=parent[r];
            x=r;
        }
        return x;
    }
    void union_vertices(int x,int y){
        int x_root=find_root(x);
        int y_root=find_root(y);
        if(x_root!=y_root) parent[y_root]=x_root;//注意 
    }
    
    int main(){
        int x,y;
        int ant=1;
        while(1){
            flag=0;
            memset(mm,0,sizeof(mm));
            for(int i=1;i<=1005;i++)
               parent[i]=i;
            while(scanf("%d%d",&x,&y)){        
                if(x<0&&y<0) return 0;
                if(x==0&&y==0) break; 
                if(find_root(x)==find_root(y)||find_root(y)!=y) 
                flag=1;
                else union_vertices(x,y);
                mm[x]=1,mm[y]=1;
              }
            int cnt=0;
            for(int i=1;i<=1005;i++)
                if(mm[i]&&find_root(i)==i) cnt++;                
            if(cnt>1) 
            flag=1;
            if(flag) printf("Case %d is not a tree.
    ",ant++);
            else printf("Case %d is a tree.
    ",ant++);    
        }
        return 0;
    }
    
    
    
     
  • 相关阅读:
    Spring Boot 使用 Micrometer 集成 Prometheus 监控 Java 应用性能
    Prometheus 通过 consul 实现自动服务发现
    Prometheus 通过 consul 分布式集群实现自动服务发现
    使用 PushGateway 进行数据上报采集
    AlertManager 之微信告警模板,UTC时间错8个小时的解决办法
    Prometheus 监控报警系统 AlertManager 之邮件告警
    Elasticsearch:使用 IP 过滤器限制连接
    Elasticsearch:创建 API key 接口访问 Elasticsearch
    Elasticsearch:反向代理及负载均衡在 Elasticsearch 中的应用
    Kibana:如何周期性地为 Dashboard 生成 PDF Report
  • 原文地址:https://www.cnblogs.com/hrlsm/p/13381815.html
Copyright © 2020-2023  润新知