Task: | Järjestys |
Sender: | lutrarutra |
Submission time: | 2016-10-08 23:51:52 +0300 |
Language: | Python3 |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | TIME LIMIT EXCEEDED | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.06 s | 1 | details |
#2 | WRONG ANSWER | 0.38 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
mx = int(input()) s = input().split(" ") arr = [] editArr = [] counter = 0 for obj in s: arr.append(int(obj)) sortedArr = [] sortedArr = arr[:] sortedArr.sort() def findBiggest(a): _biggest = 0 for obj in a: _biggest = max(_biggest, obj) return _biggest def lol(): counter = 0 tempBiggest = 0 tempArr = arr[:] sumstr = "" while True: tempBiggest = findBiggest(tempArr) if tempBiggest == 1: return [sumstr, counter] indxOfTheBiggest = tempArr.index(tempBiggest) if indxOfTheBiggest == tempArr.__len__() - 1: tempArr.remove(tempBiggest) tempBiggest = 0 elif indxOfTheBiggest != 0: a, b = indxOfTheBiggest, 0 tempArr[a], tempArr[b] = tempArr[b], tempArr[a] sumstr += str(a+1) + " " counter += 1 if indxOfTheBiggest == 0: a, b = 0, tempArr.__len__() - 1 tempArr[a], tempArr[b] = tempArr[b], tempArr[a] sumstr += str(b+1) + " " counter += 1 a, b = lol() print(b) print(a.strip())
Test details
Test 1
Group: 1
Verdict: WRONG ANSWER
input |
---|
10 9 3 4 7 6 5 10 2 8 1 |
correct output |
---|
32 10 10 9 10 9 8 7 9 4 2 1 4 5 2... |
user output |
---|
14 7 10 7 9 8 4 7 5 6 5 3 4 2 3 |
Test 2
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 650 716 982 41 133 1000 876 92... |
correct output |
---|
3984 207 207 206 207 128 127 126 12... |
user output |
---|
1974 6 1000 97 999 132 998 797 997 ... |
Test 3
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
100000 94703 47808 62366 31885 7091 8... |
correct output |
---|
399956 98676 98676 98675 98676 62994 ... |
user output |
---|
(empty) |