Task: | Maalarit |
Sender: | OulaK |
Submission time: | 2016-10-16 23:52:31 +0300 |
Language: | C++ |
Status: | READY |
Result: | 37 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | ACCEPTED | 25 |
#3 | WRONG ANSWER | 0 |
#4 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.05 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 1 | details |
#3 | ACCEPTED | 0.05 s | 1 | details |
#4 | ACCEPTED | 0.06 s | 1 | details |
#5 | ACCEPTED | 0.05 s | 1 | details |
#6 | ACCEPTED | 0.05 s | 1 | details |
#7 | ACCEPTED | 0.19 s | 2 | details |
#8 | ACCEPTED | 0.29 s | 2 | details |
#9 | ACCEPTED | 0.25 s | 2 | details |
#10 | ACCEPTED | 0.11 s | 2 | details |
#11 | ACCEPTED | 0.20 s | 2 | details |
#12 | ACCEPTED | 0.05 s | 2 | details |
#13 | ACCEPTED | 0.32 s | 3 | details |
#14 | ACCEPTED | 0.29 s | 3 | details |
#15 | ACCEPTED | 0.46 s | 3 | details |
#16 | ACCEPTED | 0.58 s | 3 | details |
#17 | WRONG ANSWER | 0.12 s | 3 | details |
#18 | ACCEPTED | 0.06 s | 3 | details |
#19 | TIME LIMIT EXCEEDED | -- | 4 | details |
#20 | TIME LIMIT EXCEEDED | -- | 4 | details |
#21 | TIME LIMIT EXCEEDED | -- | 4 | details |
#22 | TIME LIMIT EXCEEDED | -- | 4 | details |
#23 | TIME LIMIT EXCEEDED | -- | 4 | details |
#24 | TIME LIMIT EXCEEDED | -- | 4 | details |
Code
#include <bits/stdc++.h> using namespace std; // Ihan ku ois ioccc:hen osallistunu, sääliks käy jos teiän pitää lukee näitä long long s = 1e18; int p = 0; void r(long long x[], long long w[], long long f[], long long v[], int n, int i, int a) { int m = v[i] ? 3 : 2; for(int ii = 1; ii <= m; ii++) { if(i > 0 && w[i - 1] == ii) continue; if(i > 1 && w[i - 1] == 3 && w[i - 2] == 2 && ii == 2) continue; if(i > 0 && w[i - 1] == 3 && ii == 3) continue; if(i > 1 && w[i - 1] == 3 && w[i - 2] == 1 && ii == 1) continue; w[i] = ii; if(i >= n - 1) { long long m[3] = {0,0,0}; for(int iii = 0; iii < n; iii++) if(m[w[iii] - 1] < x[iii]) m[w[iii] - 1] = x[iii]; if(s > m[0] + m[1] + m[2]) { s = m[0] + m[1] + m[2]; p = m[2] ? 3 : 2; for(int a = 0; a < n; a++) f[a] = w[a]; } } else r(x, w, f, v, n, i + 1, ii == 3 ? a + 1 : a); } } inline int loop(long long x[], long long w[], long long v[], int n) { int mi1 = 0; int mi2 = 0; for(int i = 0; i < n; i++) { if((x[mi1] < x[i] && x[i] >= 0) && (i < 1||w[i - 1] != 1) && (i >= n - 2||w[i + 1] != 1)) mi1 = i; if(i == n - 1 && mi1 == 0 && x[0] == -1) return 0; } w[mi1] = 1; for(int i = 0; i < n; i++) { if(((x[mi2] < x[i] && i != mi1 && x[i] >= 0)||mi2 == mi1) && (i < 1||w[i - 1] != 1) && (i >= n - 2||w[i + 1] != 1)) mi2 = i; } int si = mi1 < mi2 ? mi1 : mi2; int li = mi1 > mi2 ? mi1 : mi2; int mi = si; for(int i = si + 1; i < li; i++) if(x[mi] > x[i] && !w[i]) mi = i; if(mi != si) { w[mi] = 3; v[mi] = 1; } w[mi2] = 1; x[mi1] = -1; x[mi2] = -1; return 1; } int main() { int n; cin >> n; long long x[n], xt[n], w[n], v[n]; for(int i = 0; i < n; i++) cin >> x[i]; memset(w, 0, sizeof(long long) * n); memset(v, 0, sizeof(long long) * n); memcpy(xt, x, sizeof(long long) * n); while(loop(xt, w, v, n)) continue; for(int i = 0; i < n; i++) if(!w[i]) w[i] = 2; memset(xt, 0, sizeof(long long) * n); r(x, w, xt, v, n, 0, 0); cout << s << " " << p << "\n"; for(long long i : xt) cout << i << " "; cout << "\n"; return 0; }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
10 22 54 3 91 69 90 40 29 83 71 |
correct output |
---|
174 3 2 1 2 1 2 1 2 1 2 1 |
user output |
---|
174 2 1 2 1 2 1 2 1 2 1 2 |
Test 2
Group: 1
Verdict: ACCEPTED
input |
---|
10 49 3 96 38 90 18 92 74 83 1 |
correct output |
---|
170 3 1 2 1 2 1 2 1 2 1 2 |
user output |
---|
170 2 1 2 1 2 1 2 1 2 1 2 |
Test 3
Group: 1
Verdict: ACCEPTED
input |
---|
10 46 3 41 30 16 17 12 93 80 81 |
correct output |
---|
173 3 2 1 2 1 2 1 2 1 2 1 |
user output |
---|
173 2 1 2 1 2 1 2 1 2 1 2 |
Test 4
Group: 1
Verdict: ACCEPTED
input |
---|
10 46 8 95 85 82 73 82 92 53 90 |
correct output |
---|
187 3 1 2 1 2 1 2 1 2 1 2 |
user output |
---|
187 2 1 2 1 2 1 2 1 2 1 2 |
Test 5
Group: 1
Verdict: ACCEPTED
input |
---|
10 41 18 61 59 40 96 5 2 74 38 |
correct output |
---|
159 3 2 1 2 1 2 1 2 3 1 2 |
user output |
---|
159 3 1 2 1 2 1 2 1 3 2 1 |
Test 6
Group: 1
Verdict: ACCEPTED
input |
---|
10 1 1 1 1 1 1 1 1 1 1 |
correct output |
---|
2 3 2 1 2 1 2 1 2 1 2 1 |
user output |
---|
2 2 1 2 1 2 1 2 1 2 1 2 |
Test 7
Group: 2
Verdict: ACCEPTED
input |
---|
100 1 39 94 5 24 84 84 10 78 61 38... |
correct output |
---|
193 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
user output |
---|
193 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 8
Group: 2
Verdict: ACCEPTED
input |
---|
100 31 73 18 88 49 28 66 5 32 48 9... |
correct output |
---|
199 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ... |
user output |
---|
199 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 9
Group: 2
Verdict: ACCEPTED
input |
---|
100 45 56 36 60 31 10 23 79 29 17 ... |
correct output |
---|
198 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
user output |
---|
198 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 10
Group: 2
Verdict: ACCEPTED
input |
---|
100 1 77 70 62 21 68 40 54 90 62 1... |
correct output |
---|
194 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
user output |
---|
194 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 11
Group: 2
Verdict: ACCEPTED
input |
---|
100 4 47 41 81 56 64 12 10 20 100 ... |
correct output |
---|
189 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ... |
user output |
---|
189 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
10 1 1 1 1 1 1 1 1 1 1 |
correct output |
---|
2 3 2 1 2 1 2 1 2 1 2 1 |
user output |
---|
2 2 1 2 1 2 1 2 1 2 1 2 |
Test 13
Group: 3
Verdict: ACCEPTED
input |
---|
100 256160448 813097800 167146270 ... |
correct output |
---|
1929869257 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
user output |
---|
1929869257 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 14
Group: 3
Verdict: ACCEPTED
input |
---|
100 520002672 3542567 24668528 959... |
correct output |
---|
1946957555 3 1 2 3 1 2 1 2 1 2 1 2 1 2 1 2 ... |
user output |
---|
1946957555 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 15
Group: 3
Verdict: ACCEPTED
input |
---|
100 483158423 780224665 844754665 ... |
correct output |
---|
1959373560 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ... |
user output |
---|
1959373560 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 16
Group: 3
Verdict: ACCEPTED
input |
---|
100 969647264 128558017 889036329 ... |
correct output |
---|
1997942264 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ... |
user output |
---|
1997942264 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 17
Group: 3
Verdict: WRONG ANSWER
input |
---|
100 745018527 400495893 635468795 ... |
correct output |
---|
1961391143 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ... |
user output |
---|
1983812469 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 18
Group: 3
Verdict: ACCEPTED
input |
---|
10 1 1 1 1 1 1 1 1 1 1 |
correct output |
---|
2 3 2 1 2 1 2 1 2 1 2 1 |
user output |
---|
2 2 1 2 1 2 1 2 1 2 1 2 |
Test 19
Group: 4
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 197349274 775463806 263930657 ... |
correct output |
---|
1999942635 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
user output |
---|
(empty) |
Test 20
Group: 4
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 102296405 34648120 320393597 9... |
correct output |
---|
1999930943 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ... |
user output |
---|
(empty) |
Test 21
Group: 4
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 781254921 418252056 502363453 ... |
correct output |
---|
1999987794 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
user output |
---|
(empty) |
Test 22
Group: 4
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 849784881 230439009 455097426 ... |
correct output |
---|
1999979439 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
user output |
---|
(empty) |
Test 23
Group: 4
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 851456132 13422224 537539701 4... |
correct output |
---|
1999948226 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
user output |
---|
(empty) |
Test 24
Group: 4
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
2 3 3 1 3 1 3 1 3 1 3 1 3 1 3 1 3 ... |
user output |
---|
(empty) |