题目链接:https://pintia.cn/problem-sets/994805342720868352/problems/994805349851185152
题目大意:
Eulerian:连通图且所有定点的度为偶数
Semi-Eulerian:连通图,且只有两个点的度为奇数
Non-Eulerian:其它
分析:并查集判断是否为连通图,再看各个定点的度就可以了,主要是没读懂题。。。
#include <bits/stdc++.h>
using namespace std;
const int N = 510;
int n, m, deg[N], pre[N], num[N];
void init() {
for(int i = 1; i < N; i++) {
pre[i] = i;
num[i] = 1;
}
}
int find(int x) {
return x == pre[x] ? x : pre[x] = find(pre[x]);
}
void unionn(int a, int b) {
int ra = find(a);
int rb = find(b);
if(ra != rb) {
pre[rb] = ra;
num[ra] += num[rb];
}
}
int main() {
init();
scanf("%d %d", &n, &m);
int a, b, odd = 0, even = 0;
while(m--) {
scanf("%d %d", &a, &b);
deg[a]++;
deg[b]++;
unionn(a, b);
}
for(int i = 1; i <= n; i++) {
if(deg[i] % 2 == 0) even++;
else odd++;
}
for(int i = 1; i <= n; i++)
printf("%d%s", deg[i], i == n ? "\n" : " ");
int rt = find(1);
if(num[rt] != n) {
printf("Non-Eulerian\n");
} else {
if(even == n) printf("Eulerian\n");
else if(odd == 2) printf("Semi-Eulerian\n");
else printf("Non-Eulerian\n");
}
return 0;
}