A1126
Description:
给出节点数和边数并给出所有边,判断该图是否为欧拉图,若为欧拉图并构成环输出"Eulerian"、不能构成环输出"Semi-Eulerian",非欧拉图输出"Non-Eulerian";
思路:
-
规则题目描述得挺清楚,不再赘述,注意判断该图是否为强连通图,非强连通图则非欧拉图,比如对于测试:
9 13
5 7
1 2
1 3
2 3
2 4
3 4
5 2
7 6
6 3
4 5
6 4
5 6
8 9应该输出:
2 4 4 4 4 4 2 1 1
Non-Eulerian -
判断是否为强连通图,可以用并查集做,最终判断集合个数是否为1,或者遍历节点检查所有节点的父节点是否相同,以下代码用的后者,
-
并查集的背诵模板及注解见另一篇博客A1107 Social Clusters
#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#include<map>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 505;
int node[maxn];
int fa[maxn];
int get(int n){
if(n == fa[n]) return n;
return fa[n] = get(fa[n]);
}
int me(int u, int v){
u = get(u);
v = get(v);
if(u != v){
fa[u] = v;
}
}
int n, m;
bool mp[maxn][maxn];
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("1.txt", "r", stdin);
#endif // ONLINE_JUDGE
memset(mp, true, sizeof(mp));
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++)
fa[i] = i;
int u, v;
for(int i = 0; i < m; i++){
scanf("%d%d", &u, &v);
if(mp[u][v]||mp[v][u]){
node[u]++;
node[v]++;
me(u, v);
mp[u][v] = false;
mp[v][u] = false;
}
}
int cnt = 0, comfa = get(1);
for(int i = 1; i <= n; i++){
if(i!=1) printf(" ");
if(get(i) != comfa) comfa = -1;
if(node[i]%2) cnt++;
printf("%d", node[i]);
}
if(cnt == 0 && comfa!=-1) printf("\nEulerian");
else if(cnt == 2 && comfa!=-1) printf("\nSemi-Eulerian");
else printf("\nNon-Eulerian");
return 0;
}