原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=3018
题意:一群蚂蚁去n个城市,m条路,必须走完m条路,每条路只能走一次,n个城市可能不连通,孤立点的存在就舍去该点,问蚂蚁分几批去走?
分析:n个点可能不连通,并查集找出各个连通集合。判断每个集合里的点的度,若全为偶数,则是欧拉回路,一批蚂蚁即可;若有奇数,看奇数个数,除以2就是需要的蚂蚁批数。为什么看奇数个数,除以2,奇数的存在是成双的,欧拉通路由度数为奇数为起点,度数为奇数的点为终点。
#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<vector>
#include<cstring>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<string>
#include<stdio.h>
#define INF 1000000000
#define eps 0.0001
using namespace std;
int n, m;
int deg[100005];
int used[100005];
int fa[100005];
int odd[100005];
vector<int> vec;
int find(int x)
{
if (x != fa[x])
fa[x] = find(fa[x]);
return fa[x];
}
int main()
{
int a, b;
int faa, fab;
while (~scanf("%d%d", &n, &m))
{
vec.clear();
memset(used, 0, sizeof(used));
memset(deg, 0, sizeof(deg));
memset(odd, 0, sizeof(odd));
for (int i = 1; i <= n; i++)
fa[i] = i;
while (m--)
{
scanf("%d%d", &a, &b);
deg[a]++;
deg[b]++;
faa = find(a);
fab = find(b);
fa[faa] = fab;
}
for (int i = 1; i <= n; i++)
{
int f = find(i);
if (!used[f])
{
used[f] = 1;
vec.push_back(f);
}
if (deg[i] & 1)//为奇数
odd[f]++;
}
int sum = 0;
for (int i = 0; i < vec.size(); i++)
{
if (deg[vec[i]] == 0)continue;//孤立点,舍去
if (odd[vec[i]] == 0)
sum++;
else
sum += (odd[vec[i]] / 2);
}
printf("%d\n", sum);
}
return 0;
}