并查集之POJ1308
来源:互联网 发布:anaconda linux 下载 编辑:程序博客网 时间:2024/05/18 08:39
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>int i;int s[1000];int flag = 1;//flag为0标志着不是树void Initialize(int *s)//初始化操作{for (i = 1; i < 1000; i++)s[i] = i;}int Find(int x, int *s)//查找操作,可以不用递归而用while实现{if (s[x] == x)return x;elsereturn Find(s[x], s);}void SetUnion(int n, int m, int *s)//合并操作{if (n == m)flag = 0;else if (s[m] == m)s[m] = n;elseflag = 0;}int main(){int n, m;int times = 1, first = 0, root;Initialize(s);while (scanf("%d %d", &n, &m) != EOF){if (n < 0 || m < 0)break;if (n == 0 && m == 0){for (i = 0; i < 1000; i++){if (first == 0 && s[i] != i)//找到第一个父节点不是本身的节点{first = 1;if (s[s[i]] == i)//说明存在环{flag = 0;break;}root = Find(i, s);//确定根节点}else if (first == 1 && s[i] != i){if (root != Find(i, s))//看是否有一个根节点flag = 0;}}if (flag == 1)printf("Case %d is a tree.\n", times);else printf("Case %d is not a tree.\n", times);times++;Initialize(s);flag = 1;first = 0;}else{SetUnion(n, m, s);//执行合并,将m的父节点置为n}}return 0;}
- 并查集之POJ1308
- POJ1308-并查集
- Poj1308 并查集
- 并查集POJ1308
- poj1308【并查集】
- poj1308 并查集
- 并查集 poj1308 hd1272
- HDU1325 &&poj1308 基础并查集
- 【POJ1308】【坑点过多】【并查集】
- POJ1308-----并查集基础题
- POJ1308——并查集
- hdu1856&&poj1308(基础并查集)
- POJ1308--并查集--Is It A Tree?
- Is It A Tree?--POJ1308--并查集
- poj1308 (并查集)Is It A Tree?
- hdu1325&&poj1308 Is It A Tree? 基础并查集
- POJ1308 - Is It A Tree? (并查集)
- POJ1308/HDU1325/NYOJ129-Is It A Tree?,并查集!
- 机房收费系统合作的一些感受
- 山西煤老板买煤--简单新思路
- 浏览器插件之ActiveX开发(四)----web页面调用ActiveX
- 您需要注意的c 的11个要点[转贴] 基础知识
- 算法导论——插入排序
- 并查集之POJ1308
- 浏览器插件之ActiveX开发(五)----关于ActiveX的数字签名
- UVa 757 / POJ 1042 / East Central North America 1999 Gone Fishing (枚举&贪心&想法题&优先队列)
- mysql 用户新建、授权、删除。密码修改
- ARM裸机程序开发10(LED控制程序)
- 限价房证的办理1-电子职场历程
- SAP移动类型309注意事项
- XZ压缩最新压缩率之王
- Linux 内核的virtio框架