Is It A Tree?
来源:互联网 发布:卡盟域名填什么 编辑:程序博客网 时间:2024/06/06 10:58
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.
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 45 6 0 08 1 7 3 6 2 8 9 7 57 4 7 8 7 6 0 03 8 6 8 6 45 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<stdio.h>#include<string.h>#include<iostream>using namespace std;const int maxn=100000+9;int f[maxn],vis[maxn],k;int find(int v){ if(f[v]!=v) f[v]=find(f[v]); return f[v];}int main(){ int a,b,l=1; while(~scanf("%d%d",&a,&b),a!=-1||b!=-1) { k=0; if(!a||!b) printf("Case %d is a tree.\n",l++); else { for(int i=1; i<=maxn; i++) f[i]=i; memset(vis,0,sizeof(vis)); int t1=find(a); int t2=find(b); if(t1!=t2) f[t2]=t1; else k=1; vis[a]=vis[b]=1; int m,n; while(~scanf("%d %d",&m,&n)) { if(m==0&&n==0) break; int t1=find(m); int t2=find(n); if(t1!=t2) f[t2]=t1; else k=1; vis[m]=vis[n]=1; } int ans=0; for(int i=1; i<=maxn; i++) { if(vis[i]&&find(i)==i) ans++; } if(ans>1) k=1; if(k==1) printf("Case %d is not a tree.\n",l++); else printf("Case %d is a tree.\n",l++); } } return 0;}
阅读全文
0 0
- Is It A Tree?
- Is it a tree?
- Is It A Tree?
- Is It A Tree?
- Is It A Tree?
- Is It A Tree?
- Is It A Tree?
- Is It A Tree?
- Is It A Tree?
- Is It A Tree?
- IS IT A tree
- Is It A Tree?
- Is It A Tree?
- Is It A Tree?
- is it a tree
- Is It A Tree?
- Is It A Tree?
- Is It A Tree?
- 本地搜索神器Everything
- js实现导航条等滚动后位置固定
- iOS 返回键文字隐藏
- 2017Android 面试回忆录(腾讯/阿里/滴滴/美团...)(附答案 )更新中。。
- Hibernate,JPA注解(一)
- Is It A Tree?
- 多周期CPU设计——流水灯
- Qt学习13——电子时钟
- Android 开源项目分类汇总
- Bootstarp模板及实践经验分享
- JAVA高并发多线程必须懂的50个问题
- SQL注入之报错注入
- 移动通信实习报告
- python之基础numpy库使用(一)