[코드트리/python] dx, dy 테크닉

꽃길 문제 푸는데 복습 겸 remind 하려고 풀어봤다.

 

 

dx, dy = [1,0,-1,0], [0, -1, 0, 1]
x, y = 0, 0
n = int(input())
arr = [
    tuple(input().split())
    for _ in range(n)
]

for direction, num in arr:
    if direction == 'E':
        x, y = x + (int(num) * dx[0]), y + dy[0]
    elif direction == 'S':
        x, y = x + dx[1], y + (int(num) * dy[1])
    elif direction == 'W':
        x, y = x + (int(num) * dx[2]), y + dy[2]
    else:
        x, y = x + dx[3], y + (int(num) * dy[3])

print(x, y)