HDOJ 1878 查并集

题目：http://acm.hdu.edu.cn/showproblem.php?pid=1878

题意：判断能否走一个欧拉回路（题目中文解释）

#include<bits/stdc++.h>
#define INF 1e18
#define inf 1e9
#define min(a,b) a<b?a:b
#define max(a,b) a>b?a:b
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define IOS ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
const int _max = 10005;

int father[_max];
int l[_max];
inline void init(int n){
    for(int i = 1 ; i <= n ; i++){
        father[i] = i;
        l[i] = 0;
    }
    return ;
}
inline int find(int x){
    while(father[x] != x)
        x = father[x];
    return x;
}
inline void Union(int a,int b){
    int temp_a = find(a);
    int temp_b = find(b);
    if(temp_a != temp_b)
        father[temp_a] = temp_b;
}
inline int ans(int n){
    int sum = 0;
    for(int i = 1 ; i <= n ; i++)
        if(father[i] == i)
            sum++;
    return sum;
}
int main(){
    IOS;
    int n,m,u,v;
    bool flag;
    while(cin>>n){
        if(!n) break;
        flag=true;
        cin>>m;
        init(n);
        for(int i = 1 ; i <= m ; i++){
            cin>>u>>v;
            l[u]++,l[v]++;
            Union(u,v);
        }
        if(ans(n)!=1) flag = false;
        for(int i = 1 ; i <= n ; i++){
            if(l[i]&1){
                flag = false;
                break;
            }
        }
        if(flag) cout<<1<<endl;
        else cout<<0<<endl;
    }
    return 0;
}