小希的迷宫
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58645 Accepted Submission(s): 18463
整个文件以两个-1结尾。
题意:
给你一个无向图,是否成环,且只有一个环
思路:
裸的并查集,先通过并查是否成环,再根据查看是否有1个环以上,感觉dfs好像也可以做
code:
#include<string.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stdio.h>
using namespace std;
const int N = 100005;
int flag[N], father[N];
void Init()
{
for (int i = 0; i <= 100000; i++)
flag[i] = 0, father[i] = i;
}
int Find(int x)
{
if (x != father[x])
father[x] = Find(father[x]);
return father[x];
}
void Merge(int a, int b)
{
int p = Find(a);
int q = Find(b);
if (p > q)
father[p] = q;
else
father[q] = p;
}
int main()
{
int a, b;
while (~scanf("%d%d", &a, &b))
{
if (a == -1 && b == -1)
break;
Init();
int FLAG = 0;
while (1)
{
if (a == 0 && b == 0)
break;
if (Find(a) == Find(b))
FLAG = 1;
Merge(a, b);
flag[a] = 1, flag[b] = 1;
scanf("%d%d", &a, &b);
}
if (FLAG == 1)
printf("No\n");
else
{
int sum = 0;
for (int i = 0; i <= 100000; i++)
if (flag[i] && Find(i) == i)
sum++;
if (sum > 1)
printf("No\n");
else
printf("Yes\n");
}
}
return 0;
}