POJ 1308 Is It A Tree? (并查集)
2013-02-28 13:46
495 查看
Is It A Tree?
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
Sample Output
Source
North Central North America 1997
这里坑爹了,不知道空树也是树,一直当不是树输出.....话说HDU的1325同样代码A不了??
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 16947 | Accepted: 5791 |
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
North Central North America 1997
这里坑爹了,不知道空树也是树,一直当不是树输出.....话说HDU的1325同样代码A不了??
#include <iostream> #include <cstring> #include <cstdio> using namespace std; const int maxn=111111; int data[maxn],cnt; inline int getid(int a) { for(int i=1; i<=cnt; i++) if(data[i]==a) return i; data[++cnt]=a; return cnt; } int pre[maxn]; void init() { int i; for(i=1; i<=maxn; i++ ) pre[i] = i; } int find(int x) { int r=x; while(r!=pre[r]) r=pre[r]; int i=x,j; while(i!=r) { j=pre[i]; pre[i]=r; i=j; } return r; } void unon(int a,int b) { int at = find(a); int bt = find(b); if(at==bt) return; else { pre[at] = pre[bt]; } } int main() { int n,m,ca=1,u,v,i; while(cin>>n>>m) { if(n<0&&m<0) break; init(); memset(data,-1,sizeof(data)); cnt=0; bool flag=true; if(n==0&&m==0) { cout<<"Case "<<ca++<<" is a tree."<<endl; continue; } while(true) { if(n==0&&m==0) break; u=getid(n),v=getid(m); if(find(u)==find(v)) flag=false; unon(u,v); cin>>n>>m; } int father=find(1); for(i=2; i<cnt; i++) if(father!=find(i)) { flag=false; break; } if(flag) cout<<"Case "<<ca++<<" is a tree."<<endl; else cout<<"Case "<<ca++<<" is not a tree."<<endl; } return 0; }
相关文章推荐
- POJ 1308 Is It A Tree?(并查集)
- HDU 1325 POJ 1308 Is It A Tree? (并查集)
- poj 1308 Is It A Tree?(并查集)
- TOJ 1856 POJ 1308 HDU 1325 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?(并查集 判断树)
- POJ1308 Is It A Tree?(树,并查集)
- poj 1308 Is It A Tree?(并查集)
- 并查集之POJ--1308--Is It A Tree?
- HDU 1325&&POJ 1308 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?(并查集)
- HDU 1325 POJ 1308 Is It ATree?(并查集)
- [POJ 1308]Is It A Tree?(并查集判断图是否为一棵有根树)
- POJ 1308 && HDU 1325 Is It A Tree? (并查集)
- poj 1308 Is It A Tree? 并查集,有向树的判断