【欧拉回路】 Codeforces Round #296 (Div. 1) C - Data Center Drama

给出一个连通图，添加最少的边使得每个点的出度和入度均为偶数。。。本质就是求一条欧拉回路，因为把欧拉回路上的边奇偶反转就是符合题意。。。

#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 1500005
#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

struct Edge
{
	int u, v, next;
	Edge() {}
	Edge(int u, int v, int next) : u(u), v(v), next(next) {}
}E[maxm];

int H[maxn], cntE;
int du[maxn];
bool vis[maxm];
vector<int> ans;
int n, m;

void addedges(int u, int v)
{
	E[cntE] = Edge(u, v, H[u]);
	H[u] = cntE++;
	E[cntE] = Edge(v, u, H[v]);
	H[v] = cntE++;
}

void init()
{
	cntE = 0;
	memset(H, -1, sizeof H);
	memset(du, 0, sizeof du);
}

void read()
{
	int u, v;
	scanf("%d%d", &n, &m);
	while(m--) {
		scanf("%d%d", &u, &v);
		addedges(u, v);
		du[u]++, du[v]++;
	}
}

void dfs(int u)
{
	for(int& e = H[u]; ~e;) {
		if(vis[e / 2]) e = E[e].next;
		else {
			vis[e / 2] = true;
			int t = e;
			e = E[e].next;
			dfs(E[t].v);
			ans.push_back(t);
		}
	}
}

void work()
{
	int last = -1;
	for(int i = 1; i <= n; i++) if(du[i] % 2) {
		if(last == -1) last = i;
		else {
			addedges(i, last);
			last = -1;
		}
	}
	if(cntE / 2 % 2) addedges(1, 1);
	dfs(1);
	printf("%d\n", (int)ans.size());
	for(int i = 0; i < ans.size(); i++) {
		if(i & 1) printf("%d %d\n", E[ans[i]].v, E[ans[i]].u);
		else printf("%d %d\n", E[ans[i]].u, E[ans[i]].v);
	}
}

int main()
{
	init();
	read();
	work();
	
	return 0;
}