[欧拉回路] Codeforces 528C #296 (Div. 1) C. Data Center Drama

题意都点晦涩啊
就是加尽量少的边 然后给每条边定向 使得每个点出入度都是偶数
我们考虑一条偶数长度欧拉回路 每隔一条边反向一次 就好了
奇数条怎么办 任意加一个自环就好了

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=100005;
const int M=500005;

struct edge{
  int u,v,next;
}G[M<<1];
int head[N],inum=1;
inline void add(int u,int v,int p){
  G[p].u=u; G[p].v=v; G[p].next=head[u]; head[u]=p;
}

int fat[M<<1];
inline void init(int n){
  for (int i=1;i<=n;i++) fat[i]=i;
}
inline int Fat(int u){
  return fat[u]==u?u:fat[u]=Fat(fat[u]);
}

int pnt;
int lst[M];
#define V G[p].v
inline void dfs(int u){
  for (int p=Fat(head[u]);p;p=Fat(G[p].next)){
    fat[p]=G[p].next;
    fat[p^1]=G[p^1].next;
    dfs(V);
    lst[++pnt]=p;
  }
}

int n,m,deg[N];

int main(){
  int iu,iv;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(m);
  for (int i=1;i<=m;i++) read(iu),read(iv),deg[iu]++,deg[iv]++,add(iu,iv,++inum),add(iv,iu,++inum);
  int last=0;
  for (int i=1;i<=n;i++)
    if (deg[i]&1)
      if (last)
    add(last,i,++inum),add(i,last,++inum),last=0;
      else
    last=i;
  if ((inum>>1)&1)
    add(1,1,++inum),add(1,1,++inum);
  init(inum);
  dfs(1);
  printf("%d\n",inum>>1);
  for (int i=1;i<=pnt;i++)
    if (i&1)
      printf("%d %d\n",G[lst[i]].u,G[lst[i]].v);
    else
      printf("%d %d\n",G[lst[i]].v,G[lst[i]].u);
  return 0;
}