[백준] 1021번 회전하는 큐 (파이썬)

1021번: 회전하는 큐

 

코드

n, m = map(int, input().split())
want_list = list(map(int, input().split()))

num_list = [i+1 for i in range(n)]

cnt = 0
answer = []
for i in range(m):
    if num_list.index(want_list[i]) >= len(num_list)/2:
        while num_list[0] != want_list[i]:
            x= num_list.pop()
            num_list.insert(0,x)
            cnt += 1
    else:
        while num_list[0] != want_list[i]:
            x = num_list.pop(0)
            num_list.append(x)
            cnt += 1
    answer.append(num_list.pop(0))

print(cnt)