[파이썬] 백준 뱀 문제 3190
https://www.acmicpc.net/problem/3190from collections import dequea,b = 0,0d= 0mi = 0n = int(input())k = int(input())group = set()for _ in range(k): x,y = map(int,input().split()) group.add((x-1,y-1)) L = int(input())X = []C = []for i in range(L): x,c = input().split() X.append(int(x)) C.append(c) turns = dict(zip(X, C)) dx = [0,1,0,-1]dy = [1,0,-1,0]def dir(d): dl = (d..
2025. 4. 20.