首页 > ACM题库 > HDU-杭电 > HDU 1325 Is It A Tree?-并查集-[解题报告] C++
2013
12-09

HDU 1325 Is It A Tree?-并查集-[解题报告] C++

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.

输入:

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.

输出:

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.

#include <iostream>
 #include <stdio.h>
 #include <map>
 using namespace std;
 
 map<int,int>my_map;
 map<int,int>my_map2;
 int f[111111];
 int s;
 int cnt;
 int sum;
 
 void init()
 {
     int i;
     for(i=1;i<=100000;i++)
     {
         f[i]=i;
     }
     my_map.clear();
     my_map2.clear();
     s=0;
     cnt=0;
     sum=0;
 }
 
 int find(int x)
 {
     if(x==f[x])
     {
         return x;
     }
     int t=find(f[x]);
     f[x]=t;
     return t;
 }
 
 void Union(int a,int b)
 {
     f[b]=a;
 }
 
 int main()
 {
     int a,b;
     bool flag=false;
     init();
     int count=1;
     while(~scanf("%d%d",&a,&b))
     {
         if(a==0 && b==0)
         {
             if(flag)
             {
                 printf("Case %d is not a tree.\n",count++);
                 flag=false;
             }
             else
             {
                 if((sum==(cnt-1) && s==(cnt-1)) || (sum==0 && cnt==0))
                 {
                     printf("Case %d is a tree.\n",count++);
                 }
                 else
                 {
                     printf("Case %d is not a tree.\n",count++);
                 }
             }
             init();
             continue;
         }
         if(a<0 && b<0)
         {
             break;
         }
         if(!my_map[a])
         {
             my_map[a]++;
             cnt++;
         }
         if(!my_map2[b])
         {
             my_map2[b]++;
             s++;
         }
         if(!my_map[b])
         {
             my_map[b]++;
             cnt++;
         }
 
         int x,y;
         if(a==b)
         continue;
         x=find(a);
         y=find(b);
         if(x==y)
         {
             flag=true;
         }
         else
         {
             Union(x,y);
             sum++;
         }
     }
     return 0;
 }

解题报告转自:http://www.cnblogs.com/ouyangduoduo/archive/2013/05/14/3077389.html


  1. Hello Web Admin, I noticed that your On-Page SEO is is missing a few factors, for one you do not use all three H tags in your post, also I notice that you are not using bold or italics properly in your SEO optimization. On-Page SEO means more now than ever since the new Google update: Panda. No longer are backlinks and simply pinging or sending out a RSS feed the key to getting Google PageRank or Alexa Rankings, You now NEED On-Page SEO. So what is good On-Page SEO?First your keyword must appear in the title.Then it must appear in the URL.You have to optimize your keyword and make sure that it has a nice keyword density of 3-5% in your article with relevant LSI (Latent Semantic Indexing). Then you should spread all H1,H2,H3 tags in your article.Your Keyword should appear in your first paragraph and in the last sentence of the page. You should have relevant usage of Bold and italics of your keyword.There should be one internal link to a page on your blog and you should have one image with an alt tag that has your keyword….wait there's even more Now what if i told you there was a simple WordPress plugin that does all the On-Page SEO, and automatically for you? That's right AUTOMATICALLY, just watch this 4minute video for more information at.

  2. 很高兴你会喜欢这个网站。目前还没有一个开发团队,网站是我一个人在维护,都是用的开源系统,也没有太多需要开发的部分,主要是内容整理。非常感谢你的关注。