上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计图给你，让你帮忙判断她的设计图是否符合她的设计思路。比如下面的例子，前两个是符合条件的，但是最后一个却有两种方法从5到达8。
Input 输入包含多组数据，每组数据是一个以0 0结尾的整数对列表，表示了一条通道连接的两个房间的编号。房间的编号至少为1，且不超过100000。每两组数据之间有一个空行。 整个文件以两个-1结尾。 Output 对于输入的每一组数据，输出仅包括一行。如果该迷宫符合小希的思路，那么输出"Yes"，否则输出"No"。 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 Yes Yes No
这道题很简单，但是有许多坑点 1>题目中不会给出所有点，只会在给定点来建树； 2>直接输入0 0，就是空树的情况，输出Yes 3>还有森林（就是多棵树）和自环应该输出No
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<map> #include<queue> #include<cmath> using namespace std; typedef long long LL; const int inf = 0x3f3f3f3f; const double eps = 1e-8; const double PI = acos(-1); #define pb push_back #define mp make_pair #define fi first #define se second const int N = 1e5 + 5; int b[N]; bool vis[N]; int join(int x) { if(b[x] != x){ b[x] = join(b[x]); } return b[x]; } void join1(int x,int y) { int p = join(x); int q = join(y); if(p != q){ b[p] = q; } } int main() { int n,m; int MAX = -1; while(~scanf("%d %d",&n,&m)) { for(int i = 1;i < N;++i){ b[i] = i; vis[i] = false; } if(n == -1 && m == -1){ break; } if(n == 0 && m == 0){ printf("Yes\n"); continue; } join1(n,m); vis[n] = vis[m] = true; bool flag = false; while(true){ scanf("%d %d",&n,&m); if(n == 0 && m == 0){ break; } if(join(n) == join(m)){ flag = true; }else{ join1(n,m); } vis[n] = vis[m] = true; } if(flag){ printf("No\n"); }else{ int cnt = 0; for(int i = 1;i < N;++i){ if(vis[i] && b[i] == i){ cnt++; } } if(cnt != 1) printf("No\n"); else printf("Yes\n"); } } return 0; }poj1308 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.
据说这道题数据是特别的水，和上道题的代码一样，唯一需要区别的就是 1 1 0 0每个节点有自环是不行的应该输出not a tree
