整个文件以两个-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 -1Sample Output
Yes Yes No
思路:简单并查集,判断是否成环,只有当不存在环且根节点为1时,条件才成立;本来这么简单的题解着应该松松的,却存在直接a=b=0这种情况,果然hdu就是这么坑,我恨啊
代码:
#include<cstdio>
struct S
{
int w,vis;
}f[100005];
int find(int x)
{
if (x != f[x].w)
f[x].w = find(f[x].w);
return f[x].w;
}
void join(int x,int y)
{
int fx = find(x),fy = find(y);
f[fx].w = fy;
}
int main()
{
int i,a,b,flag;
while (scanf("%d %d",&a,&b) && (a != -1 || b != -1))
{
if (a == 0 && b == 0)
{
printf("Yes\n");
continue;
}
flag = 1;
int road = 0;
for (i = 1;i <= 100000;i ++)
f[i].w = i,f[i].vis = 0;
join(a,b);
f[a].vis = f[b].vis = 1;
while (scanf("%d %d",&a,&b) && (a != 0 || b != 0))
{
if (find(a) == find(b)) flag = 0;
else join(a,b);
f[a].vis = f[b].vis = 1;
}
for (i = 1;i < 100001;i ++)
if (f[i].vis && f[i].w == i) road ++;
if (road > 1) flag = 0;
if (flag) printf("Yes\n");
else printf("No\n");
}
return 0;
}