Task: | Maalarit |
Sender: | OulaK |
Submission time: | 2016-10-16 12:22:20 +0300 |
Language: | C++ |
Status: | READY |
Result: | 12 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 12 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
#4 | WRONG ANSWER | 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.05 s | 1 | details |
#5 | ACCEPTED | 0.05 s | 1 | details |
#6 | ACCEPTED | 0.05 s | 1 | details |
#7 | ACCEPTED | 0.05 s | 2 | details |
#8 | ACCEPTED | 0.06 s | 2 | details |
#9 | ACCEPTED | 0.05 s | 2 | details |
#10 | ACCEPTED | 0.05 s | 2 | details |
#11 | WRONG ANSWER | 0.05 s | 2 | details |
#12 | ACCEPTED | 0.05 s | 2 | details |
#13 | ACCEPTED | 0.05 s | 3 | details |
#14 | WRONG ANSWER | 0.05 s | 3 | details |
#15 | WRONG ANSWER | 0.06 s | 3 | details |
#16 | ACCEPTED | 0.06 s | 3 | details |
#17 | WRONG ANSWER | 0.06 s | 3 | details |
#18 | ACCEPTED | 0.05 s | 3 | details |
#19 | WRONG ANSWER | 0.11 s | 4 | details |
#20 | WRONG ANSWER | 0.13 s | 4 | details |
#21 | WRONG ANSWER | 0.10 s | 4 | details |
#22 | WRONG ANSWER | 0.10 s | 4 | details |
#23 | WRONG ANSWER | 0.13 s | 4 | details |
#24 | ACCEPTED | 0.07 s | 4 | details |
Code
#include <bits/stdc++.h> using namespace std; inline int getMaxIn(int x[], 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 int calcSum(int w[], int x[], int n) { int m[] = {0,0,0}; for(int i = 0; i < n; i++) if(m[w[i] - 1] < x[i]) m[w[i] - 1] = x[i]; return m[0] + m[1] + m[2]; } inline void logic(int x[], int w[], int n) { int mi = getMaxIn(x, n); int minI = x[mi] < x[mi + 1] ? mi : mi + 1; vector<int> possible; for(int i = 0; i < n - 3; i++) { int sumM = x[i+1] + x[i+2]; int minB = x[i] < x[i + 3] ? i : i + 3; int maxB = x[i] > x[i + 3] ? i : i + 3; if((sumM < x[minB]) && (x[minI] < x[maxB])) possible.push_back(i); } int finW[n]; for(int i = 0; i < n; i++) finW[i] = i % 2 + 1; int baseSum = calcSum(finW, x, n); while(possible.size() > 0) { memset(w, 0, sizeof(int) * n); int ii = possible.back(); w[ii ] = 1; w[ii + 3] = 1; w[ii + 1] = x[ii + 1] > x[ii + 2] ? 2 : 3; w[ii + 2] = x[ii + 1] < x[ii + 2] ? 2 : 3; int toNum = w[ii] == 1 ? 2 : 1; for(int iii = ii - 1; iii >= 0; iii--) { if(w[iii]) continue; w[iii] = toNum; toNum = !(toNum - 1) + 1; } toNum = w[ii + 3] == 1 ? 2 : 1; for(int iii = ii + 3; iii < n; iii++) { if(w[iii]) continue; w[iii] = toNum; toNum = !(toNum - 1) + 1; } int sum = calcSum(w, x, n); if(baseSum > sum) { memcpy(finW, w, sizeof(int) * n); baseSum = sum; } possible.pop_back(); } memcpy(w, finW, sizeof(int) * n); } int main() { int n; cin >> n; int x[n], w[n]; for(int i = 0; i < n; i++) cin >> x[i]; memset(w, 0, sizeof(int) * n); logic(x, w, n); int m[] = {0,0,0}; for(int i = 0; i < n; i++) if(m[w[i] - 1] < x[i]) m[w[i] - 1] = x[i]; int sum = m[0] + m[1] + m[2]; cout << sum << " " << (!m[2] ? 2 : 3) << "\n"; for(int i : w) cout << i << " "; cout << "\n\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 2 1 2 1 2 1 2 3 1 2 |
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: WRONG ANSWER
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 |
---|
197 2 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: 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 |
---|
1950044951 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ... |
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 |
---|
-2064126839 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 |
---|
-2130349075 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: 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 |
---|
-2146541661 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ... |
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 |
---|
-2143127543 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
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 |
---|
-2141977363 3 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 ... |
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 |
---|
-2056300680 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
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 |
---|
-2147084241 3 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
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 ... |