Codeforces Round #375 (Div. 2) E. One-Way Reform(有n个点,m条无向边,给每条边定向,使得入度等于出度的点最多)
传送门:CodeforcesRound#375(Div.2)E.One-WayReform题意:有n个点,m条无向边,给每条边定向,使得入度等于出度的点最多(n欧拉回路证明#includeusingnamespacestd;constintN=210;typedefpairPI;structEdge{intfrom,to,next;boolflag;}e[N*N];inthead[N],tot,d