| Task: | Järjestys |
| Sender: | lutrarutra |
| Submission time: | 2016-10-16 03:30:38 +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.07 s | 1 | details |
| #2 | WRONG ANSWER | 0.42 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 = arr[:]
sortedArr.sort()
def find(A):
rtn = -1
x = 0
while x < A.__len__():
if A[x] != x+1:
rtn = max(rtn, A[x])
x += 1
return rtn
def lol():
counter = 0
sr = ""
tempArr1 = []
tempArr2 = []
tempArr = arr[:]
#print(tempArr)
tempBiggest = 0
while arr != sortedArr:
tempBiggest = find(tempArr)
if tempBiggest == -1:
return [counter, sr]
indx = tempArr.index(tempBiggest)
if indx != 0:
temp = tempBiggest
tempArr1 = tempArr[:indx+1]
tempArr2 = tempArr[indx+1:]
tempArr1 = tempArr1[::-1]
tempArr = tempArr1 + tempArr2
counter += 1
sr += str(indx+1) + " "
indx = tempArr.index(tempBiggest)
if indx == 0:
tempArr1 = tempArr[tempArr[0]:]
tempArr2 = tempArr[:tempArr[0]]
tempArr2 = tempArr2[::-1]
tempArr = tempArr2 + tempArr1
counter += 1
sr += str(indx + 1) + " "
a, b = lol()
print(a)
print(b, end="")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 |
|---|
| 11 7 1 4 1 7 1 4 1 3 1 1 |
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 |
|---|
| 1976 6 1 904 1 964 1 333 1 27 1 291... |
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) |
