[python] 17143. 낚시왕
문제 출처 17143. 낚시왕 풀이 from collections import deque R, C, M = map(int, input().split()) sharks = [list(map(int, input().split())) for _ in range(M)] # y, x, 속력, 방향, 크기 dr, dc = (0, -1, 1, 0, 0), (0, 0, 0, 1, -1) def move(shark): r, c, s, d, z = shark while s > 0: nr, nc = r + dr[d], c + dc[d] s -= 1 if nr > R: d = 1 nr -= 2 elif nr C: d = 4 nc -= 2 elif nc < 1: d = 3 n..
2019. 10. 19.
[python] 17472. 다리 만들기 2
문제 출처 17472. 다리 만들기 2 풀이 from collections import deque N, M = map(int, input().split()) arr = [list(map(int, input().split())) for _ in range(N)] visited = [[0]*M for _ in range(N)] dx, dy = (1, 0, -1, 0), (0, 1, 0, -1) def numbering_irlands(x, y): visited[y][x] = 1 arr[y][x] = irland q = deque() q.append((x, y)) while q: x, y = q.popleft() for i in range(4): nx, ny = x + dx[i], y + dy[i] if nx ..
2019. 10. 19.
