题目意思就是有一个至少三个点的环,环上的每个点可以延展出去,构成树,但是不能再构成环
1.并查集
#include <iostream>
#include <stdio.h>
using namespace std;
int pre[1010];
int find(int x)
{
return pre[x]==x ? x : find(pre[x]);
}
int main()
{
int n, m;
while(cin >> n >> m){
for(int i = 1; i <= n; i++)
pre[i] = i;
int flag, a, b, num, flag2;
flag = num = flag2 = 0;
for(int i = 0; i < m; i++){
cin >> a >> b;
if(flag2)
continue;
int px = find(a), py = find(b);
if(px != py){
num++;
pre[px] = py;
}
else{
if(!flag){
num++;
flag = 1;
}
else
flag2 = 1;
}
}
if(!flag2 && flag && num == n)
cout << "FHTAGN!\n";
else
cout << "NO\n";
}
return 0;
}
2.bfs
只有一个环必是,边数等于点数这种情况,bfs用于遍历点,查看图是否连通
#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
const int maxn = 1000 + 5;
int n,m;
int my_index=0;
vector<int>G[maxn];
int vis[maxn]={0};
void bfs(int u)
{
queue<int >Q;
Q.push(u);
while(!Q.empty())
{
int s = Q.front();
Q.pop();
if(!vis[s])
my_index++;
vis[s]=1;
//cout<<s<<endl;
for(int i = 0;i < G[s].size(); i++)
{
int v = G[s][i];
if(!vis[v]) Q.push(v);
}
}
}
int main()
{
scanf("%d%d",&n,&m);
for(int i = 1;i <= m; i++)
{
int a,b;
scanf("%d%d",&a,&b);
G[a].push_back(b);
G[b].push_back(a);
}
bfs(1);
//cout<<my_index<<endl;
if(my_index == n && m==n) printf("FHTAGN!\n");
else printf("NO\n");
}