题目地址:点击打开链接
思路:本来想找点并查集判环的题,结果找到了这题,根本用不到并查集,判断一个图是否为连通图且没有环其实就一个条件,点数-1=边数
AC代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
using namespace std;
const int maxn = 100010;
int visit[maxn];
int main()
{
int m,n;
int k,l;
while(scanf("%d%d",&m,&n))
{
k = 0;//每次刚开始点为0
l = 0;//每次刚开始边为0
memset(visit,0,sizeof(visit));
if(m == -1 && n == -1)
break;
if(m + n == 0)
{
printf("Yes\n");
continue;
}
if(visit[m] == 0)
{
k++;
visit[m] = 1;
}
if(visit[n] == 0)
{
k++;
visit[n] = 1;
}
l++;
while(scanf("%d%d",&m,&n))
{
if(m + n == 0)
break;
if(visit[m] == 0)
{
k++;
visit[m] = 1;
}
if(visit[n] == 0)
{
k++;
visit[n] = 1;
}
l++;
}
if(k - 1 == l)
{
printf("Yes\n");
}
else
{
printf("No\n");
}
}
return 0;
}