[acmicpc] 8911. 거북이(python)

• 시뮬레이션 문제
• python deque의 rotate함수 활용

 

정답코드

import sys
input=sys.stdin.readline
from collections import deque

testcase=int(input())
dir=deque([[-1,0],[0,1],[1,0],[0,-1]])
for _ in range(testcase):
    test=input().strip()
    max_x,max_y,min_x,min_y=0,0,0,0
    x,y=0,0
    for c in test:
        if c=='L':
            dir.rotate(1)
        if c=='R':
            dir.rotate(-1)
        if c=='F':
            x=x+dir[0][0]
            y=y+dir[0][1]
        if c=='B':
            x=x-dir[0][0]
            y=y-dir[0][1]
        max_x=max(x,max_x)
        max_y=max(y,max_y)
        min_x=min(x,min_x)
        min_y=min(y,min_y)
    print(abs(max_x-min_x)*abs(max_y-min_y)) #가로*세로

---

https://www.acmicpc.net/problem/8911

8911번: 거북이