forked from daiwb/Algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path121.cpp
More file actions
119 lines (114 loc) · 2.2 KB
/
121.cpp
File metadata and controls
119 lines (114 loc) · 2.2 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
117
118
119
//ac
#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
#define for if(0); else for
class node {
public:
int black;
int white;
int degree;
node() : black(0), white(0), degree(0) {}
};
int n;
int main() {
scanf("%d", &n);
vector<node> mm(n);
vector<vector<int> > mat(n, vector<int>(n, -1));
vector<vector<int> > link(n);
for (int i = 0; i < n; ++i) {
int a;
while (scanf("%d", &a) && a) {
--a;
mm[i].degree += 1;
mat[i][a] = 0;
link[i].push_back(a);
}
}
while (1) {
int idx = -1;
for (int i = 0; i < n; ++i) {
if (mm[i].degree % 2) {
idx = i;
break;
}
}
if (idx != -1) {
int start = 2;
while (1) {
int flag = 1;
for (int i = 0; i < n; ++i) {
if (mat[idx][i] == 0) {
mat[idx][i] = mat[i][idx] = start;
mm[idx].degree -= 1; mm[i].degree -= 1;
if (start == 1) {
mm[idx].black += 1, mm[i].black += 1;
} else {
mm[idx].white += 1, mm[i].white += 1;
}
idx = i;
start = 3 - start;
flag = 0;
break;
}
}
if (flag) break;
}
continue;
}
for (int i = 0; i < n; ++i) {
if (mm[i].degree > 0 && mm[i].black + mm[i].white > 0) {
idx = i;
break;
}
}
int start = 2;
if (idx != -1) {
if (mm[idx].black == 0) start = 1;
if (mm[idx].white == 0) start = 2;
}
if (idx == -1) {
for (int i = 0; i < n; ++i) {
if (mm[i].degree > 0) {
idx = i;
break;
}
}
}
if (idx == -1) break;
while (1) {
int flag = 1;
for (int i = 0; i < n; ++i) {
if (mat[idx][i] == 0) {
mat[idx][i] = mat[i][idx] = start;
mm[idx].degree -= 1; mm[i].degree -= 1;
if (start == 1) {
mm[idx].black += 1, mm[i].black += 1;
} else {
mm[idx].white += 1, mm[i].white += 1;
}
idx = i;
start = 3 - start;
flag = 0;
break;
}
}
if (flag) break;
}
}
for (int i = 0; i < n; ++i) {
if ((mm[i].black >= 2 && mm[i].white == 0) || (mm[i].black == 0 && mm[i].white >= 2)) {
printf("No solution\n");
return 0;
}
}
for (int i = 0; i < n; ++i) {
int size = link[i].size();
for (int j = 0; j < size; ++j) {
printf("%d ", mat[i][link[i][j]]);
}
printf("0\n");
}
return 0;
}