poj 1308 Is It A Tree? 并查集
2017-11-19 21:07
471 查看
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
#include <cstdio>
#include<iostream>
using namespace std;
#define nsize 110
int par[nsize];
bool isTree;
void init() {
for (int i = 0; i < nsize; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//森林的情况还没有考虑
void unite(int x, int y) {
int b = find(y);
if (b != y) {
isTree = false;
return;
}
int a = find(x);
if (a == b)
isTree = false;
else {
par[b] = a;
}
}
int main() {
int a, b;
int x, y;
int testCase = 0;
while (cin >> a >> b,a+b>=0) {
isTree = true;
testCase++;
int tree[1010];
int i = 0;
init();
tree[i++] = a;
tree[i++] = b;
unite(a, b);
if (a + b == 0) {
printf("Case %d is a tree.\n", testCase);
continue;
}
while (cin >> x >> y, x + y) {
tree[i++] = x;
tree[i++] = y;
unite(x, y);
}
for (int j = 1; j < i; j++) {
if (find(tree[j]) != find(tree[0])) {
isTree = false;
}
}
if (isTree)
printf("Case %d is a tree.\n",testCase);
else
printf("Case %d is not a tree.\n",testCase);
}
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 34570 | Accepted: 11699 |
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
#include <cstdio>
#include<iostream>
using namespace std;
#define nsize 110
int par[nsize];
bool isTree;
void init() {
for (int i = 0; i < nsize; i++) {
par[i] = i;
}
}
int find(int x) {
if (par[x] == x) {
return x;
}
else {
return par[x] = find(par[x]);
}
}
//森林的情况还没有考虑
void unite(int x, int y) {
int b = find(y);
if (b != y) {
isTree = false;
return;
}
int a = find(x);
if (a == b)
isTree = false;
else {
par[b] = a;
}
}
int main() {
int a, b;
int x, y;
int testCase = 0;
while (cin >> a >> b,a+b>=0) {
isTree = true;
testCase++;
int tree[1010];
int i = 0;
init();
tree[i++] = a;
tree[i++] = b;
unite(a, b);
if (a + b == 0) {
printf("Case %d is a tree.\n", testCase);
continue;
}
while (cin >> x >> y, x + y) {
tree[i++] = x;
tree[i++] = y;
unite(x, y);
}
for (int j = 1; j < i; j++) {
if (find(tree[j]) != find(tree[0])) {
isTree = false;
}
}
if (isTree)
printf("Case %d is a tree.\n",testCase);
else
printf("Case %d is not a tree.\n",testCase);
}
}
相关文章推荐
- poj 1308 Is It A Tree? 并查集
- 【并查集】hdu 1325 Is It A Tree? 或 poj 1308 Is It A Tree?
- Poj1308 Is It A Tree? 并查集
- POJ 1308 hdu 1325 Is It A Tree?【并查集+入度 判断一个有向图是树】
- 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? (并查集)
- POJ-1308 Is It A Tree? -并查集
- POJ 1308 Is It A Tree? - 并查集
- Is It A Tree? POJ - 1308(并查集判断是否为树)
- poj 1308 Is It A Tree? 数据结构 并查集
- POJ 1308 Is It A Tree?【裸的并查集】
- POJ 1308 HDU 1358 Is It A Tree? 并查集 (好多WA点)
- 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? (并查集)