HUD Is It A Tree?!!!!!)
Posted luhongkai
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了HUD Is It A Tree?!!!!!)相关的知识,希望对你有一定的参考价值。
这个是一个非常恶心的题,刚开始以为是POJ的题,结果发现不是,一直都是超时。上题吧
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.
#include<stdio.h> #include<string.h> const int INF=1010; int par[INF],ran[INF],sum; bool t; int find(int x) { if(par[x]==x) return x; return par[x]=find(par[x]); } void unite(int x,int y) { x=find(x); y=find(y); if(x!=y) par[x]=y; else t=true; } int main() { int x,y,m=1; while(1) { memset(par,0,sizeof(par)); memset(ran,0,sizeof(ran)); t=false; while(scanf("%d%d",&x,&y)&&(x||y)) { if(x<0&&y<0) return 0; if(par[x]==0) par[x]=x; if(par[y]==0) par[y]=y; unite(x,y); ran[y]++; } if(t) printf("Case %d is not a tree. ",m++); else { int sum=0,num=0; for(int i=1; i<INF; i++) { if(par[i]==i) { sum++; if(sum>1) { num=1; break; } } if(ran[i]>1) { num=1; break; } } if(num) printf("Case %d is not a tree. ",m++); else printf("Case %d is a tree. ",m++); } } return 0; }
以上是关于HUD Is It A Tree?!!!!!)的主要内容,如果未能解决你的问题,请参考以下文章
1135. Is It A Red-Black Tree (30)
A11231123 Is It a Complete AVL Tree (30分)