blob: 19c66d3816e3bb734f9efa8be7b50791d3c464b2 (
plain)
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
|
#include <iostream>
#include <map>
std::map<int, int> c[3];
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, m;
std::cin >> n >> m;
for (int i = 0; i < 3; i++) {
auto &cc = c[i];
for (int j = 0; j < n; j++) {
int k;
std::cin >> k;
cc[k]++;
}
}
int current = 0;
std::pair<int, int> last;
int last_put = 0;
while (true) {
auto &cc = c[current];
if (current == last_put) {
auto i = cc.begin();
last.first = i->first;
last.second = 1;
if (i->second == 1) {
cc.erase(i);
} else {
i->second--;
}
last_put = current;
} else {
bool can = false;
for (auto i = cc.upper_bound(last.first); i != cc.end(); ++i) {
if (i->second >= last.second) {
can = true;
i->second -= last.second;
last.first = i->first;
if (i->second == 0) {
cc.erase(i);
}
break;
}
}
if (!can) {
auto end = cc.upper_bound(last.first);
for (auto i = cc.begin(); i != end; ++i) {
if (i->second > last.second) {
can = true;
i->second -= last.second + 1;
last.first = i->first;
last.second++;
if (i->second == 0) {
cc.erase(i);
}
break;
}
}
}
if (can) {
last_put = current;
}
}
if (cc.empty()) {
std::cout << current + 1;
break;
}
current++;
current %= 3;
}
return 0;
}
|
