forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathF.cpp
More file actions
116 lines (97 loc) · 2.99 KB
/
F.cpp
File metadata and controls
116 lines (97 loc) · 2.99 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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
#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 DEBUG(X) { cout << #X << " = " << 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))
#define ll long long
#define SZ(x) ((int) (x).size())
using namespace std;
const int MN = 1011;
int nLeft, nRight, m;
int usedLeft[MN][MN], usedRight[MN][MN];
int degLeft[MN], degRight[MN];
pair<int,int> edges[MN*MN];
int res[MN][MN];
void uncolor(int u, int v, int c) {
assert(usedLeft[u][c] == v);
assert(usedRight[v][c] == u);
usedLeft[u][c] = 0;
usedRight[v][c] = 0;
}
void color(int u, int v, int c) {
assert(!usedLeft[u][c]);
assert(!usedRight[v][c]);
usedLeft[u][c] = v;
usedRight[v][c] = u;
res[u][v] = c;
}
// recolor edge (u, v) from color c1 to color c2
void recolor(int u, int v, int c1, int c2) {
uncolor(u, v, c1);
if (usedRight[v][c2]) {
int uu = usedRight[v][c2];
recolor(uu, v, c2, c1);
color(u, v, c2);
}
else if (usedLeft[u][c2]) {
int vv = usedLeft[u][c2];
recolor(u, vv, c2, c1);
color(u, v, c2);
}
else {
color(u, v, c2);
}
}
int main() {
ios :: sync_with_stdio(0); cin.tie(0);
while (scanf("%d%d%d", &nLeft, &nRight, &m) == 3) {
memset(degLeft, 0, sizeof degLeft);
memset(degRight, 0, sizeof degRight);
int D = 0;
FOR(i,1,m) {
int u, v; scanf("%d%d", &u, &v);
edges[i] = make_pair(u, v);
degLeft[u]++;
degRight[v]++;
D = max(D, degLeft[u]);
D = max(D, degRight[v]);
}
printf("%d\n", D);
FOR(i,1,m) {
int u = edges[i].first, v = edges[i].second;
// if there is some color C, that is not used in both u and v
bool ok = false;
FOR(c,1,D) {
if (!usedLeft[u][c] && !usedRight[v][c]) {
ok = true;
color(u, v, c);
break;
}
}
if (ok) continue;
int c1 = -1, c2 = -1;
FOR(c,1,D) {
if (usedLeft[u][c] && !usedRight[v][c]) {
c1 = c;
break;
}
}
FOR(c,1,D) {
if (!usedLeft[u][c] && usedRight[v][c]) {
c2 = c;
break;
}
}
recolor(u, usedLeft[u][c1], c1, c2);
color(u, v, c1);
}
FOR(i,1,m) {
int u = edges[i].first, v = edges[i].second;
printf("%d ", res[u][v]);
}
puts("");
}
}