HDU 1272 小希的迷宫
题目链接:vjudge传送门
具体思路:
做过Is It A Tree后就知道,这题比它简单点,只需要把判断入度的条件去掉,感兴趣的这里是题解
这题具体是用并查集维护
新加入一条边时,判断两点是否同一集合
是,则构成有环图,不满足
否,则将两点加入同一集合中
最后判断一下是否是空图(满足),或者非连通图(不满足),即可
具体代码:
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int N = 1e6;
int fa[N], visit[N];
void init()
{
memset(visit, 0, sizeof(visit));
for (int i = 1; i <= N; i++)
fa[i] = i;
}
int find(int son)
{
if (son == fa[son])
return son;
return fa[son] = find(fa[son]);
}
void unite(int u, int v)
{
int r1 = find(u);
int r2 = find(v);
if (r1 == r2) return;
fa[r2] = r1;
}
int main()
{
int flag = 1;
int n, m;
init();
while (~scanf("%d%d", &n, &m))
{
if (m == -1 && n == -1)break;
if (!(m == 0 && n == 0))
{
visit[m] = 1, visit[n] = 1;
if (fa[m] == fa[n])flag = 0; //新加入的边,from->to,to所属集合不能和from相同
else unite(n, m);
}
else
{
//判断空图或非连通图的情况
int root = 0;
int isNull = 1, isNotLink = 0;;
for (int i = 1; i <= N; i++) {
if (visit[i] && fa[i] == i) {
root++;
isNull = 0;
if (root > 1) {
isNotLink = 1;
break;
}
}
}
if (isNull)flag = 1; //空图
if (isNotLink)flag = 0; //非连通图
if (flag) printf("Yes\n");
else printf("No\n");
init();
flag = 1;
}
}
return 0;
}