forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathE.cpp
More file actions
91 lines (74 loc) · 2.17 KB
/
E.cpp
File metadata and controls
91 lines (74 loc) · 2.17 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
const int MN = 100111;
struct Edge {
int to;
list<Edge>::iterator rev;
Edge(int to) :to(to) {}
};
list<Edge> adj[MN];
vector<int> path; // our result
void find_path(int v) {
while(adj[v].size() > 0) {
int vn = adj[v].front().to;
adj[vn].erase(adj[v].front().rev);
adj[v].pop_front();
find_path(vn);
}
path.push_back(v);
}
void add_edge(int a, int b) {
adj[a].push_front(Edge(b));
auto ita = adj[a].begin();
adj[b].push_front(Edge(a));
auto itb = adj[b].begin();
ita->rev = itb;
itb->rev = ita;
}
int deg[MN];
int main() {
int n, m;
while (scanf("%d%d", &n, &m) == 2) {
FOR(i,1,n) adj[i].clear();
path.clear();
memset(deg, 0, sizeof deg);
FOR(i,1,m) {
int u, v; scanf("%d%d", &u, &v);
add_edge(u, v);
deg[u]++;
deg[v]++;
}
int last = -1;
FOR(i,1,n) if (deg[i] % 2 == 1) {
if (last == -1) last = i;
else {
add_edge(last, i);
last = -1;
++m;
}
}
if (m % 2) {
add_edge(1, 1);
++m;
}
find_path(1);
// PR0(path, path.size());
cout << m << endl;
for(int i = 0; i < path.size() - 1; i += 2) {
int x = path[i];
int y = path[(i+1) % path.size()];
int z = path[(i+2) % path.size()];
printf("%d %d\n", x, y);
printf("%d %d\n", z, y);
}
}
return 0;
}