Task: | Split in Three |
Sender: | faustaadp |
Submission time: | 2021-01-30 09:26:52 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 0.27 s | 1, 2 | details |
#2 | ACCEPTED | 0.01 s | 1, 2 | details |
#3 | RUNTIME ERROR | 0.27 s | 1, 2 | details |
#4 | RUNTIME ERROR | 0.28 s | 1, 2 | details |
#5 | ACCEPTED | 0.01 s | 1, 2 | details |
#6 | RUNTIME ERROR | 0.29 s | 1, 2 | details |
#7 | RUNTIME ERROR | 0.28 s | 1, 2 | details |
#8 | ACCEPTED | 0.01 s | 1, 2 | details |
#9 | RUNTIME ERROR | 0.28 s | 2 | details |
#10 | RUNTIME ERROR | 0.29 s | 2 | details |
#11 | RUNTIME ERROR | 0.27 s | 2 | details |
#12 | ACCEPTED | 0.01 s | 2 | details |
#13 | RUNTIME ERROR | 0.28 s | 2 | details |
#14 | RUNTIME ERROR | 0.28 s | 2 | details |
#15 | ACCEPTED | 0.01 s | 2 | details |
Code
#include<bits/stdc++.h> using namespace std; typedef long long ll; #define pb push_back #define mp make_pair #define fi first #define se second const ll NN = 2e5 + 5; const ll mo = 1e9 + 7; ll n; ll d[110][1010101]; ll a[NN]; void gagal() { cout << "IMPOSSIBLE\n"; exit(0); } ll depe(ll pos, ll jum) { if(jum < 0) return 0; if(jum == 0) return 1; if(pos > n) return 0; ll ret = d[pos][jum]; if(ret == -1) { ret = 0; if(a[pos] == 0 && depe(pos + 1, jum - pos))ret = 1; if(depe(pos + 1, jum))ret = 1; d[pos][jum] = ret; } return ret; } void pc(ll pos, ll jum, ll isi) { if(jum == 0) return ; if(a[pos] == 0 && depe(pos + 1, jum - pos)) { a[pos] = isi; pc(pos + 1, jum - pos, isi); } else if(depe(pos + 1, jum))pc(pos + 1, jum, isi); } int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin >> n; ll sum = n * (n + 1) / 2; if(sum % 3 != 0) gagal(); memset(d, -1, sizeof(d)); pc(1, sum / 3 - 1, 1); memset(d, -1, sizeof(d)); pc(1, sum / 3, 2); memset(d, -1, sizeof(d)); pc(1, sum / 3 + 1, 3); for(ll i = 1; i <= n; i++) { cout << a[i]; if(i < n) cout << " "; else cout << "\n"; } }
Test details
Test 1
Group: 1, 2
Verdict: RUNTIME ERROR
input |
---|
3 |
correct output |
---|
1 2 3 |
user output |
---|
(empty) |
Test 2
Group: 1, 2
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 3
Group: 1, 2
Verdict: RUNTIME ERROR
input |
---|
5 |
correct output |
---|
1 3 1 3 2 |
user output |
---|
(empty) |
Test 4
Group: 1, 2
Verdict: RUNTIME ERROR
input |
---|
6 |
correct output |
---|
1 3 2 2 1 3 |
user output |
---|
(empty) |
Test 5
Group: 1, 2
Verdict: ACCEPTED
input |
---|
7 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 6
Group: 1, 2
Verdict: RUNTIME ERROR
input |
---|
8 |
correct output |
---|
2 3 1 2 3 3 2 1 |
user output |
---|
(empty) |
Test 7
Group: 1, 2
Verdict: RUNTIME ERROR
input |
---|
9 |
correct output |
---|
1 2 3 1 2 3 3 2 1 |
user output |
---|
(empty) |
Test 8
Group: 1, 2
Verdict: ACCEPTED
input |
---|
10 |
correct output |
---|
IMPOSSIBLE |
user output |
---|
IMPOSSIBLE |
Test 9
Group: 2
Verdict: RUNTIME ERROR
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: RUNTIME ERROR
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: RUNTIME ERROR
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: RUNTIME ERROR
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: RUNTIME ERROR
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 |