[baekjoon]python #18258 ํ2
https://www.acmicpc.net/problem/18258
18258๋ฒ: ํ 2
์ฒซ์งธ ์ค์ ์ฃผ์ด์ง๋ ๋ช ๋ น์ ์ N (1 ≤ N ≤ 2,000,000)์ด ์ฃผ์ด์ง๋ค. ๋์งธ ์ค๋ถํฐ N๊ฐ์ ์ค์๋ ๋ช ๋ น์ด ํ๋์ฉ ์ฃผ์ด์ง๋ค. ์ฃผ์ด์ง๋ ์ ์๋ 1๋ณด๋ค ํฌ๊ฑฐ๋ ๊ฐ๊ณ , 100,000๋ณด๋ค ์๊ฑฐ๋ ๊ฐ๋ค. ๋ฌธ์ ์ ๋์์์ง
www.acmicpc.net
import sys
from collections import deque
input = sys.stdin.readline
N = int(input())
queue = deque()
for i in range(N):
temp = list(map(str,input().split()))
if temp[0] == 'push':
queue.append(int(temp[1]))
elif temp[0] == 'front':
if len(queue) != 0:
temp = queue.popleft()
queue.appendleft(temp)
print(temp)
else:
print(-1)
elif temp[0] == 'back':
if len(queue) !=0:
temp = queue.pop()
queue.append(temp)
print(temp)
else:
print(-1)
elif temp[0] == 'size':
print(len(queue))
elif temp[0] == 'empty':
if len(queue)==0:
print(1)
else:
print(0)
else:
if len(queue)!=0:
print(queue.popleft())
else:
print(-1)
'Problem Solving > BAEKJOON' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[baekjoon]python #9095 1, 2, 3 ๋ํ๊ธฐ (0) | 2023.01.11 |
---|---|
[baekjoon]python #17219 ๋น๋ฐ๋ฒํธ ์ฐพ๊ธฐ (0) | 2023.01.11 |
[baekjoon]python #17298 ์คํฐ์ (0) | 2022.08.31 |
[baekjoon]python #2108 ํต๊ณํ (0) | 2022.06.24 |
[baekjoon]python #4949 ๊ท ํ์กํ ์ธ์ (0) | 2022.06.24 |
๋๊ธ