【欧拉回路】 HDOJ 3018 Ant Trip

最新推荐文章于 2016-01-29 17:15:14 发布

原创最新推荐文章于 2016-01-29 17:15:14 发布 · 456 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#欧拉回路 #HDOJ

欧拉回路专栏收录该内容

5 篇文章

订阅专栏

结论：一个连通块里构成欧拉回路的最少起点数=max(1, 连通块里度为奇数的个数)。。。

#include <iostream>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 100005
#define maxm 200005
#define eps 1e-7
#define mod 1000000007
#define INF 0x3f3f3f3f
#define PI (acos(-1.0))
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
#define pii pair<int, int>
#pragma comment(linker, "/STACK:16777216")
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
// head

int cnt[maxn];
int odd[maxn];
int du[maxn];
int f[maxn];
int n, m;

int find(int x)
{
	return x == f[x] ? f[x] : find(f[x]);
}

void merge(int a, int b)
{
	int aa = find(a), bb = find(b);
	if(aa != bb) f[aa] = bb;
}

void read()
{
	int u, v;
	for(int i = 0; i <= n; i++) cnt[i] = 0;
	for(int i = 0; i <= n; i++) odd[i] = 0;
	for(int i = 0; i <= n; i++) du[i] = 0;
	for(int i = 0; i <= n; i++) f[i] = i;
	while(m--) {
		scanf("%d%d", &u, &v);
		du[u]++, du[v]++;
		merge(u, v);
	}
}

void work()
{
	for(int i = 1; i <= n; i++) {
		int fa = find(i);
		cnt[fa]++;
		odd[fa] += du[i] % 2;
	}
	int ans = 0;
	for(int i = 0; i <= n; i++) if(cnt[i] >= 2) ans += max(1, odd[i] / 2);
	printf("%d\n", ans);
}

int main()
{
	while(scanf("%d%d", &n, &m)!=EOF) {
		read();
		work();
	}
	
	
	return 0;
}