Task: | Maalarit |
Sender: | OulaK |
Submission time: | 2016-10-16 20:22:26 +0300 |
Language: | C++ |
Status: | READY |
Result: | 12 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | TIME LIMIT EXCEEDED | 0 |
#3 | WRONG ANSWER | 0 |
#4 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.05 s | 1 | details |
#2 | ACCEPTED | 0.06 s | 1 | details |
#3 | ACCEPTED | 0.05 s | 1 | details |
#4 | ACCEPTED | 0.05 s | 1 | details |
#5 | ACCEPTED | 0.05 s | 1 | details |
#6 | ACCEPTED | 0.06 s | 1 | details |
#7 | ACCEPTED | 0.63 s | 2 | details |
#8 | TIME LIMIT EXCEEDED | -- | 2 | details |
#9 | ACCEPTED | 0.08 s | 2 | details |
#10 | ACCEPTED | 0.06 s | 2 | details |
#11 | ACCEPTED | 0.33 s | 2 | details |
#12 | ACCEPTED | 0.06 s | 2 | details |
#13 | WRONG ANSWER | 0.06 s | 3 | details |
#14 | WRONG ANSWER | 0.05 s | 3 | details |
#15 | WRONG ANSWER | 0.06 s | 3 | details |
#16 | WRONG ANSWER | 0.05 s | 3 | details |
#17 | WRONG ANSWER | 0.05 s | 3 | details |
#18 | ACCEPTED | 0.05 s | 3 | details |
#19 | WRONG ANSWER | 0.10 s | 4 | details |
#20 | WRONG ANSWER | 0.09 s | 4 | details |
#21 | WRONG ANSWER | 0.11 s | 4 | details |
#22 | WRONG ANSWER | 0.10 s | 4 | details |
#23 | WRONG ANSWER | 0.10 s | 4 | details |
#24 | ACCEPTED | 0.08 s | 4 | details |
Code
#include <bits/stdc++.h> using namespace std; #define S_SIZE (int)1e5 // Ihan ku ois ioccc:hen osallistunu, sääliks käy jos teiän pitää lukee näitä int x[S_SIZE], w[S_SIZE], f[S_SIZE], v[S_SIZE]; int s = 1e9, p = 0, maxSum = 0; void r(int n, int i, int a) { int m = v[i] ? 3 : 2; if(a > n / 4) m = 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(s <= maxSum) break; if(i >= n - 1) { int 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; memcpy(f, w, sizeof(int) * n); } } else r(n, i + 1, ii == 3 ? a + 1 : a); } } inline int getMaxIn(const int &n) { int maxIn = 0; for(int i = 0; i < n - 1; i++) if(x[maxIn] + x[maxIn + 1] < x[i] + x[i + 1]) maxIn = i; return maxIn; } inline void logic(int n) { int mi = getMaxIn(n); for(int i = 0; i < n - 3; i++) { int sumM = x[i+1] + x[i+2]; int maxB = x[i] > x[i + 3] ? i : i + 3; if((sumM < x[maxB])) v[x[i + 1] < x[i + 2] ? i + 1 : i + 2] = 1; } for(int i = 1; i < n - 1; i++) if(v[x[i - 1] < x[i + 1] ? i - 1 : i + 1] && x[i] < (x[i - 1] < x[i + 1] ? x[i - 1] : x[i + 1])) v[x[i - 1] < x[i + 1] ? i - 1 : i + 1] = 0; for(int i = 0; i < n - 1; i++) if(v[i] == v[i + 1]) v[x[i] < x[i + 1] ? i + 1 : i] = 0; int a = 0; for(int i = 0; i < n; i++) { if(x[a] > x[i]) a = i; if(x[i] > 40 && v[i]) v[i] = 0; } maxSum = x[a] + x[mi] + x[mi + 1]; } int main() { int n; cin >> n; for(int i = 0; i < n; i++) cin >> x[i]; memset(f, 0, sizeof(int) * n); memset(w, 0, sizeof(int) * n); memset(v, 0, sizeof(int) * n); logic(n); r(n, 0, 0); cout << s << " " << p << "\n"; for(int i = 0; i < n; i++) printf("%d ", f[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: TIME LIMIT EXCEEDED
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 |
---|
(empty) |
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: WRONG ANSWER
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
Test 14
Group: 3
Verdict: WRONG ANSWER
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
Test 15
Group: 3
Verdict: WRONG ANSWER
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
Test 16
Group: 3
Verdict: WRONG ANSWER
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
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: WRONG ANSWER
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
Test 20
Group: 4
Verdict: WRONG ANSWER
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
Test 21
Group: 4
Verdict: WRONG ANSWER
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
Test 22
Group: 4
Verdict: WRONG ANSWER
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
Test 23
Group: 4
Verdict: WRONG ANSWER
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 |
---|
1000000000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
Test 24
Group: 4
Verdict: ACCEPTED
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 |
---|
2 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |