Task: | Maalarit |
Sender: | lutrarutra |
Submission time: | 2016-10-15 13:40:53 +0300 |
Language: | Python3 |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
#4 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.06 s | 1 | details |
#2 | ACCEPTED | 0.07 s | 1 | details |
#3 | ACCEPTED | 0.07 s | 1 | details |
#4 | ACCEPTED | 0.08 s | 1 | details |
#5 | WRONG ANSWER | 0.06 s | 1 | details |
#6 | RUNTIME ERROR | 0.07 s | 1 | details |
#7 | ACCEPTED | 0.07 s | 2 | details |
#8 | WRONG ANSWER | 0.07 s | 2 | details |
#9 | ACCEPTED | 0.08 s | 2 | details |
#10 | ACCEPTED | 0.07 s | 2 | details |
#11 | WRONG ANSWER | 0.06 s | 2 | details |
#12 | RUNTIME ERROR | 0.08 s | 2 | details |
#13 | ACCEPTED | 0.07 s | 3 | details |
#14 | WRONG ANSWER | 0.08 s | 3 | details |
#15 | WRONG ANSWER | 0.07 s | 3 | details |
#16 | WRONG ANSWER | 0.06 s | 3 | details |
#17 | WRONG ANSWER | 0.07 s | 3 | details |
#18 | RUNTIME ERROR | 0.06 s | 3 | details |
#19 | WRONG ANSWER | 0.29 s | 4 | details |
#20 | TIME LIMIT EXCEEDED | -- | 4 | details |
#21 | TIME LIMIT EXCEEDED | -- | 4 | details |
#22 | TIME LIMIT EXCEEDED | -- | 4 | details |
#23 | ACCEPTED | 0.29 s | 4 | details |
#24 | RUNTIME ERROR | 0.12 s | 4 | details |
Code
import re mx = int(input()) s = input().split(" ") arr = [] editArr = [] counter = 0 for obj in s: arr.append(int(obj)) def findMax(a, ign): rtn = 0 for obj in a: if obj < ign or ign == -1: rtn = max(rtn, obj) return rtn def canFit(a, ARR, n): for _numb in a: if abs(ARR.index(_numb) - ARR.index(n)) == 1: return False return True max1 = findMax(arr, -1) max1Index = arr.index(max1) max2Index = 0 max2 = 0 if arr.__len__() != 1: max2 = findMax(arr, max1) max2Index = arr.index(max2) i = 0 sumstr = "" arr31 = [] arr32 = [] arr33 = [] if arr.__len__() == 1: print("1 1") print("1") elif abs(max1Index - max2Index) % 2 == 0 or abs(max1Index - max2Index) == 1: max1 = 0 max2 = 0 while i < arr.__len__(): if i % 2 == 0: arr31.append(arr[i]) max1 = max(max1, arr[i]) sumstr += str(1) + " " else: arr32.append(arr[i]) max2 = max(max2, arr[i]) sumstr += str(2) + " " i += 1 print(str(max1 + max2) + " " + str(2)) print(sumstr, end="") else: maxx1 = [0, 0] maxx2 = [0, 0] maxx3 = [0, 0] summa = [] sss = "" q = 0 while i < arr.__len__(): if i % 2 == 0: arr31.append(arr[i]) max1 = max(max1, arr[i]) sss += str(1) + " " else: arr32.append(arr[i]) max2 = max(max2, arr[i]) sss += str(2) + " " i += 1 kkk = max1 + max2 i = 0 while i < arr.__len__(): if i % 3 == 0: arr31.append(arr[i]) maxx1.insert(0, max(maxx1[0], arr[i])) maxx1.insert(1, arr31.__len__() -1) if arr[i] == max1: q = 1 sumstr += str(1) + " " elif i % 3 == 1: arr32.append(arr[i]) maxx2.insert(0, max(maxx2[0], arr[i])) maxx2.insert(1, arr32.__len__() - 1) if arr[i] == max1: q = 2 sumstr += str(2) + " " else: arr33.append(arr[i]) maxx3.insert(0, max(maxx3[0], arr[i])) maxx3.insert(1, arr33.__len__() - 1) if arr[i] == max1: q = 3 sumstr += str(3) + " " i += 1 if q == 1: summa = sumstr.split(" ") i = 0 while i < arr33.__len__(): if arr33[i] > arr32[i]: temp = arr32[i] arr32[i] = arr33[i] arr33[i] = temp summa[(1 + (i * 3))] = str(3) summa[(2 + (i * 3))] = str(2) if arr32[i] > arr31[i]: temp = arr31[i] arr31[i] = arr32[i] arr32[i] = temp summa[(1 + (i * 3))] = str(1) summa[(0 + (i * 3))] = str(2) i += 1 if kkk < findMax(arr32, -1) + findMax(arr33, -1) + max1: print(str(kkk) + " 2") print(sss, end="") else: print(str(findMax(arr32, -1) + findMax(arr33, -1) + max1) + " 3") print(' '.join(summa)) if q == 2: summa = sumstr.split(" ") i = 0 while i < arr33.__len__(): if arr31[i] > arr32[i]: temp = arr31[i] arr31[i] = arr32[i] arr32[i] = temp summa[(0 + (i * 3))] = str(2) summa[(2 + (i * 3))] = str(1) if arr33[i] > arr32[i]: temp = arr31[i] arr31[i] = arr32[i] arr32[i] = temp summa[(2 + (i * 3))] = str(2) summa[(1 + (i * 3))] = str(3) i += 1 if kkk < findMax(arr31, -1) + findMax(arr33, -1) + max1: print(str(kkk) + " 2") print(sss, end="") else: print(str(findMax(arr31, -1) + findMax(arr33, -1) + max1) + " 3") print(' '.join(summa)) if q == 3: summa = sumstr.split(" ") i = 0 while i < arr33.__len__(): if arr31[i] > arr32[i]: temp = arr31[i] arr31[i] = arr32[i] arr32[i] = temp summa[(0 + (i * 3))] = str(2) summa[(2 + (i * 3))] = str(1) if arr32[i] > arr33[i]: temp = arr31[i] arr31[i] = arr32[i] arr32[i] = temp summa[(2 + (i * 3))] = str(2) summa[(1 + (i * 3))] = str(3) i += 1 if kkk < findMax(arr31, -1) + findMax(arr32, -1) + max1: print(str(kkk) + " 2") print(sss, end="") else: print(str(findMax(arr31, -1) + findMax(arr32, -1) + max1) + " 3") print(' '.join(summa))
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: WRONG ANSWER
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 |
---|
192 2 1 2 1 2 1 2 1 2 1 2 |
Test 6
Group: 1
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 34, in <module> max2Index = arr.index(max2) ValueError: 0 is not in list
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: WRONG ANSWER
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 |
---|
200 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: RUNTIME ERROR
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 |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 34, in <module> max2Index = arr.index(max2) ValueError: 0 is not in list
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 |
---|
1954612158 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
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 |
---|
1986361558 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
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 |
---|
1998506986 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 |
---|
1989535926 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 18
Group: 3
Verdict: RUNTIME ERROR
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 |
---|
(empty) |
Error:
Traceback (most recent call last): File "input/code.py", line 34, in <module> max2Index = arr.index(max2) ValueError: 0 is not in list
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 |
---|
1999963967 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
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: ACCEPTED
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 |
---|
1999948226 2 1 2 1 2 1 2 1 2 1 2 1 2 1 2 1 ... |
Test 24
Group: 4
Verdict: RUNTIME ERROR
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) |
Error:
Traceback (most recent call last): File "input/code.py", line 34, in <module> max2Index = arr.index(max2) ValueError: 0 is not in list