poj1308Is It A Tree?(并查集)
来源:互联网 发布:女子养生会所项目知乎 编辑:程序博客网 时间:2024/05/17 23:47
Is It A Tree?
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 22637 Accepted: 7758
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.
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 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
Sample Output
Case 1 is a tree.Case 2 is a tree.Case 3 is not a tree.
#include<stdio.h>#include<string.h>#define N 1000int p[N]={0};int find(int x){//return x==p[x]?x:p[x]=find(p[x]);while(x!=p[x])x=p[x];return x;}int fun(int x,int y){int fy,fx;fy=find(y);fx=find(x);if(fy!=fx){p[fy]=fx;}}int main(){int k,i,a,b,flag;int sum;k=1;while(1){flag=0;while(scanf("%d %d",&a,&b)!=EOF&&a&&b){if(a==-1||b==-1)return 0;if(p[a]==0) p[a]=a;if(p[b]==0) p[b]=b;if(find(a)==find(b)) flag=1;if(flag!=1)fun(a,b);}for(i=1,sum=0;i<=N;i++){if(p[i]==i) sum++;p[i]=0;}if(sum>1||flag==1)printf("Case %d is not a tree.\n",k);else printf("Case %d is a tree.\n",k);k++;}return 0;}
0 0
- poj1308Is It A Tree?(并查集)
- poj1308Is It A Tree
- poj1308Is 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?(并查集)
- hdu 1325 Is It A Tree?(并查集)
- pku 1308 Is It A Tree?(并查集)
- HDU 1325 Is It A Tree? (并查集)
- poj1308 (并查集)Is It A Tree?
- POJ 1308 Is It A Tree? (并查集)
- poj 1308 Is It A Tree?(并查集)
- poj 1308 Is It A Tree? (并查集)
- poj 1308 Is It A Tree?(并查集)
- 数组名是一个指针常量吗?
- 第13周项目2成绩处理
- leetcode:Recover Binary Search Tree
- Velocity 用户手册-中文版
- 黑马程序员——方法的声明和实现、匿名访问
- poj1308Is It A Tree?(并查集)
- SQL Server"选定的用户拥有对象,所以无法除去该用户"(图文详解)
- 鼠标滚动事件
- CentOS7 挂载ntfs移动硬盘
- MD5加密Java工具类
- 内存堆管理器GenCollectedHeap分配对象内存及Gc触发
- asp网站程序启用浏览器和代理缓存
- SQLMAP源码阅读之盖览sqlmap.py
- 给webstorm配置ftp