[백준] [Python] 12789번 도키도키 간식드리미

www.acmicpc.net/problem/12789

12789번: 도키도키 간식드리미

 

Python

n = int(input())
queue = list(map(int,input().split()))
stack=[]
turn = 1
result = True
for i in range(n):
    if turn in queue:
        while turn != queue[0]:
            stack.append(queue.pop(0))
        queue.pop(0)
    elif turn in stack:
        while turn != stack[-1]:
            stack.pop()
        stack.pop()
    else:
        result = False
        break
    turn += 1

if result: print("Nice")
else: print("Sad")