Task: | Kolmijako |
Sender: | Mahtimursu |
Submission time: | 2021-01-23 16:27:09 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#2 | ACCEPTED | 0.01 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#4 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#5 | ACCEPTED | 0.01 s | 1, 2 | details |
#6 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#7 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#8 | ACCEPTED | 0.01 s | 1, 2 | details |
#9 | TIME LIMIT EXCEEDED | -- | 2 | details |
#10 | TIME LIMIT EXCEEDED | -- | 2 | details |
#11 | TIME LIMIT EXCEEDED | -- | 2 | details |
#12 | ACCEPTED | 0.01 s | 2 | details |
#13 | TIME LIMIT EXCEEDED | -- | 2 | details |
#14 | TIME LIMIT EXCEEDED | -- | 2 | details |
#15 | ACCEPTED | 0.01 s | 2 | details |
Code
#include <bits/stdc++.h>typedef long long ll;#define M 1000000007#define N (1 << 18)using namespace std;int ans[101];int n;ll sum;void brute(int cn) {if (cn == n) {int sums[3] = {0};for (int i = 0; i < n; ++i) {sums[ans[i] - 1] += i + 1;}ll ts = 0;for (int i = 0; i < 3; ++i) {ts += sums[i];}//if (ts != sum) cout << "ERR";//cout << sums[0] << ", " << sums[1] << ", " << sums[2] << endl;int t = sum / 3;if (sums[0] == t + 1 && sums[1] == t && sums[2] == t - 1) {for (int i = 0; i < n; ++i) {cout << ans[i] << " ";}cout << "\n";exit(0);}} else {ans[cn] = 1;brute(cn + 1);ans[cn] = 2;brute(cn + 1);ans[cn] = 3;brute(cn + 1);}}int main() {ios_base::sync_with_stdio(false);cin.tie(0);cin >> n;sum = n * (n + 1) / 2;if (sum % 3 != 0) {cout << "IMPOSSIBLE";return 0;}brute(0);return 0;}
Test details
Test 1
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
3 |
correct output |
---|
1 2 3 |
user output |
---|
3 2 1 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
5 |
correct output |
---|
1 3 1 3 2 |
user output |
---|
1 1 1 3 2 |
Test 4
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
6 |
correct output |
---|
1 3 2 2 1 3 |
user output |
---|
1 1 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: WRONG ANSWER
input |
---|
8 |
correct output |
---|
2 3 1 2 3 3 2 1 |
user output |
---|
1 1 1 2 3 3 1 2 |
Test 7
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
9 |
correct output |
---|
1 2 3 1 2 3 3 2 1 |
user output |
---|
1 1 1 1 3 1 2 2 3 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
input |
---|
10 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 9
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
42 |
correct output |
---|
1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ... |
user output |
---|
(empty) |
Test 10
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
95 |
correct output |
---|
1 3 1 3 2 1 2 3 3 2 1 1 2 3 3 ... |
user output |
---|
(empty) |
Test 11
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
96 |
correct output |
---|
1 3 2 2 1 3 1 2 3 3 2 1 1 2 3 ... |
user output |
---|
(empty) |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
97 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 13
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
98 |
correct output |
---|
2 3 1 2 3 3 2 1 1 2 3 3 2 1 1 ... |
user output |
---|
(empty) |
Test 14
Group: 2
Verdict: TIME LIMIT EXCEEDED
input |
---|
99 |
correct output |
---|
1 2 3 1 2 3 3 2 1 1 2 3 3 2 1 ... |
user output |
---|
(empty) |
Test 15
Group: 2
Verdict: ACCEPTED
input |
---|
100 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |