Task: | Split in Three |
Sender: | wlz |
Submission time: | 2021-01-31 15:49:38 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 22 |
#2 | ACCEPTED | 78 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.01 s | 1, 2 | details |
#2 | ACCEPTED | 0.01 s | 1, 2 | details |
#3 | ACCEPTED | 0.01 s | 1, 2 | details |
#4 | ACCEPTED | 0.01 s | 1, 2 | details |
#5 | ACCEPTED | 0.01 s | 1, 2 | details |
#6 | ACCEPTED | 0.01 s | 1, 2 | details |
#7 | ACCEPTED | 0.01 s | 1, 2 | details |
#8 | ACCEPTED | 0.01 s | 1, 2 | details |
#9 | ACCEPTED | 0.01 s | 2 | details |
#10 | ACCEPTED | 0.01 s | 2 | details |
#11 | ACCEPTED | 0.01 s | 2 | details |
#12 | ACCEPTED | 0.01 s | 2 | details |
#13 | ACCEPTED | 0.01 s | 2 | details |
#14 | ACCEPTED | 0.01 s | 2 | details |
#15 | ACCEPTED | 0.01 s | 2 | details |
Code
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; if (n % 3 == 0) { vector< vector<int> > v = {{1}, {2}, {3}}; for (int i = 2; 3 * i <= n; i++) { v[0].push_back(3 * i); v[1].push_back(3 * i - 1); v[2].push_back(3 * i - 2); int j = 0, k = 0; while (v[j][0] != 1) j++; while (v[k][0] != 2) k++; swap(v[j][0], v[k][0]); sort(v.begin(), v.end(), [](const vector<int> &a, const vector<int> &b) { return accumulate(a.begin(), a.end(), 0) < accumulate(b.begin(), b.end(), 0); }); } vector<int> ans(n + 1); for (int i = 0; i < 3; i++) { for (auto& x : v[i]) ans[x] = i + 1; } for (int i = 1; i <= n; i++) cout << ans[i] << ' '; cout << '\n'; } else if ((n + 1) % 3 == 0 && n > 2) { vector< vector<int> > v = {{1, 3}, {5}, {2, 4}}; for (int i = 6; i <= n; i += 3) { v[2].push_back(i); v[1].push_back(i + 1); v[0].push_back(i + 2); int j = 0, k = 0; while (v[j][0] != 1) j++; while (v[k][0] != 2) k++; swap(v[j][0], v[k][0]); sort(v.begin(), v.end(), [](const vector<int> &a, const vector<int> &b) { return accumulate(a.begin(), a.end(), 0) < accumulate(b.begin(), b.end(), 0); }); } vector<int> ans(n + 1); for (int i = 0; i < 3; i++) { for (auto& x : v[i]) ans[x] = i + 1; } for (int i = 1; i <= n; i++) cout << ans[i] << ' '; cout << '\n'; } else { cout << "IMPOSSIBLE\n"; } return 0; }
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
input |
---|
3 |
correct output |
---|
1 2 3 |
user output |
---|
1 2 3 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 3
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 |
correct output |
---|
1 3 1 3 2 |
user output |
---|
1 3 1 3 2 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
input |
---|
6 |
correct output |
---|
1 3 2 2 1 3 |
user output |
---|
1 3 2 2 1 3 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
input |
---|
7 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 6
Group: 1, 2
Verdict: ACCEPTED
input |
---|
8 |
correct output |
---|
2 3 1 2 3 3 2 1 |
user output |
---|
1 3 3 1 2 1 2 3 |
Test 7
Group: 1, 2
Verdict: ACCEPTED
input |
---|
9 |
correct output |
---|
1 2 3 1 2 3 3 2 1 |
user output |
---|
1 3 2 2 3 1 1 2 3 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
input |
---|
10 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
42 |
correct output |
---|
1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ... |
user output |
---|
1 3 2 2 1 3 3 2 1 1 2 3 3 2 1 ... |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
95 |
correct output |
---|
1 3 1 3 2 1 2 3 3 2 1 1 2 3 3 ... |
user output |
---|
1 3 1 3 2 3 2 1 1 2 3 3 2 1 1 ... Truncated |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
96 |
correct output |
---|
1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ... |
user output |
---|
1 3 2 2 1 3 3 2 1 1 2 3 3 2 1 ... Truncated |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
97 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 13
Group: 2
Verdict: ACCEPTED
input |
---|
98 |
correct output |
---|
2 3 1 2 3 3 2 1 1 2 3 3 2 1 1 ... |
user output |
---|
1 3 3 1 2 1 2 3 3 2 1 1 2 3 3 ... Truncated |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
99 |
correct output |
---|
1 2 3 1 2 3 3 2 1 1 2 3 3 2 1 ... |
user output |
---|
1 3 2 2 3 1 1 2 3 3 2 1 1 2 3 ... Truncated |
Test 15
Group: 2
Verdict: ACCEPTED
input |
---|
100 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |