Task: | Järjestys |
Sender: | lutrarutra |
Submission time: | 2016-10-16 12:21:58 +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.10 s | 2 | details |
#3 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
mx = int(input()) s = input().split(" ") arr = [] editArr = [] for obj in s: arr.append(int(obj)) sortedArr = [] sortedArr = arr[:] sortedArr.sort() # Sorts Pancakes def lol(stack): sumstr = "" counter = 1 sorted_index = 10 for i in reversed(range(len(stack))): ff = find(stack, i) stack = flip(stack, ff) sumstr += str(ff+1) + " " counter += 1 stack = flip(stack, i) sumstr += str(i +1) + " " counter += 1 return [counter, sumstr] # All of the pancakes are sorted after index # Returns the index of largest unsorted pancake def find(stack, index): largest_pancake = stack[index] largest_index = index; for i in range(index): if stack[i] > largest_pancake: largest_pancake = stack[i] largest_index = i return largest_index # Slide spatula under pancake at index and flip to top def flip(stack, index): newStack = stack[:(index + 1)] newStack.reverse() newStack += stack[(index + 1):] return newStack a,b = lol(arr) print(a) print(b)
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 |
---|
21 7 10 4 9 7 8 4 7 6 6 5 5 3 4 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 |
---|
2001 6 1000 904 999 964 998 333 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) |