关闭

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

标签: hdu1325Is It A Tree并查集森林
393人阅读 评论(0) 收藏 举报
分类:

Is It A Tree?

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


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.
 

Source
 

Recommend
Ignatius.L   |   We have carefully selected several similar problems for you:  1856 1232 1233 1102 1875 
 

解析:1.0 0 输出true
           2.并查集判断所有输入数据组成一个生成树(先将边看做无向的)
           3.用ru[x]记录是否有其他点指向点x,并且保证ru[i]==0的 i 只有一个(也就是生成树的根,因为是有向边,繁殖出现这种情况:1 2 3 2 0 0)

代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ms(a) memset(a,0,sizeof(a))
using namespace std;

const int maxn=1e5;
int f[maxn+10];
bool used[maxn+10],ru[maxn+10];

int find(int x)
{
  if(f[x]==x)return x;
  return f[x]=find(f[x]);
}

int main()
{
  freopen("1.in","r",stdin);
  
  int x,y,rx,ry,l=maxn,r=1,s=1;  
  bool flag=1;ms(used),ms(ru);
  while(scanf("%d%d",&x,&y),x>=0)
    {
      if(x==0 && y==0)
        {
          for(x=l,y=0;x<=r;x++)
		    if(used[x] && f[x]==x)y++;
		  flag=(flag&&y<=1);
		  for(x=l,y=0;x<=r;x++)
		    if(used[x] && !ru[x])y++;
		  flag=(flag&&y<=1);
		  if(flag)printf("Case %d is a tree.\n",s);
		  else printf("Case %d is not a tree.\n",s); 
          ms(used),ms(ru),flag=1,l=maxn,r=1,s++;
		  continue;
		}
	  ru[y]=1;
	  if(used[x])rx=find(x);
	  else rx=f[x]=x,used[x]=1;
	  if(used[y])ry=find(y);
	  else ry=f[y]=y,used[y]=1;
	  if(rx!=ry)f[rx]=ry;else flag=0;
	  l=min(l,min(x,y)),r=max(r,max(x,y));
	}
  return 0;
}



0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

sklearn源码解析:ensemble模型 零碎记录;如何看sklearn代码,以tree的feature_importance为例

最近看sklearn的源码比较多,好记性不如烂笔头啊,还是记一下吧。 整体: )实现的代码非常好,模块化、多继承等写的很清楚。 )predict功能通常在该模型的直接类中实现,fit通常在继...
  • mmc2015
  • mmc2015
  • 2016-07-12 10:14
  • 8261

机器学习笔记(六)Bagging及随机森林

Bagging和随机森林原理介绍以及利用sklearn的实现。
  • sinat_22594309
  • sinat_22594309
  • 2017-03-05 11:17
  • 1623

随机决策森林——OpenCV类CvRTrees使用实例

本文介绍:OpenCV机器学习库MLL中随机森林Random Trees的使用 参考文献: 1.Breiman, Leo (2001). "Random Forests". Machine ...
  • LiFeitengup
  • LiFeitengup
  • 2013-06-08 16:39
  • 14923

hdu1325Is It A Tree?——基础并查集(考思路)

A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one ...
  • WAR___NING
  • WAR___NING
  • 2015-05-28 20:26
  • 518

HDU 1325 Is It A Tree? 并查集判断是否成树

Is It A Tree? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Othe...
  • qq_33402621
  • qq_33402621
  • 2016-10-07 09:48
  • 137

HDU 1325 Is It A Tree?(并查集/有向树的判断)

B - Is It A Tree? Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Sub...
  • zyd8888102
  • zyd8888102
  • 2016-01-19 22:05
  • 154

HDU 1325 Is It A Tree? 并查集

Is It A Tree? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To...
  • u012605629
  • u012605629
  • 2014-08-23 18:38
  • 407

hdu 1325 Is It A Tree?(并查集)

因为题目中一句英语没看懂,白白浪费了半个多小时的时间。。。。不说了,说多了都是泪。 题目中每一个节点只能有一个进入点。和那个小希的迷宫很像。 #include #define N 1000000 in...
  • zizaimengzhongyue
  • zizaimengzhongyue
  • 2013-03-29 22:42
  • 298

HDU 1272小希的迷宫 1325Is It A Tree? 并查集确定图为树

这两题主要是解决一个图是否是树的问题。 有很多细节需要注意。 1、空树也是树。 2、一个图若是树需满足两个条件: ①连通分量为一; ②图中无环,包括自环和非自环。 3、边数+1=顶点数。 ...
  • Lulipeng_cpp
  • Lulipeng_cpp
  • 2012-06-25 11:19
  • 979

hdu1325Is It A Tree?(并查集)

H - Is It A Tree? Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d &...
  • qaz135135135
  • qaz135135135
  • 2016-08-01 17:16
  • 803
    个人资料
    • 访问:269518次
    • 积分:6249
    • 等级:
    • 排名:第4571名
    • 原创:353篇
    • 转载:59篇
    • 译文:0篇
    • 评论:26条
    最新评论