# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1197755 | Isam | Knjige (COCI20_knjige) | Pypy 3 | 148 ms | 51420 KiB |
import sys
n = 0
p = [0] * 1000
l = []
d = []
res = []
def solve():
global n, p
n = int(sys.stdin.readline())
p = list(map(int, sys.stdin.readline().split()))
for num in reversed(p):
l.append(num)
sorted_p = sorted(p)
for i in range(n):
cnt = 0
while l[-1] != sorted_p[i]:
res.append('UZMI L L')
res.append('STAVI L D')
d.append(l.pop())
cnt += 1
res.append('UZMI D L')
l.pop()
for _ in range(cnt):
res.append('UZMI L D')
res.append('STAVI L L')
l.append(d.pop())
res.append('STAVI D D')
d.append(sorted_p[i])
while d:
res.append('UZMI L D')
res.append('STAVI L L')
l.append(d.pop())
print(len(res))
for answer in res: print(answer);
solve()
Compilation message (stdout)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |