Hoo_Dev

문제 : 2382. 미생물 격리 난이도 : 모의 SW 역량테스트 언어 : python 문제 링크 : https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV597vbqAH0DFAVl di, dj = (0, -1, 1, 0, 0), (0, 0, 0, -1, 1) opp = [0, 2, 1, 4, 3] T = int(input()) for tc in range(1, T + 1): N, M, K = map(int, input().split()) # N : 셀의 갯수, M : 격리 시간, K : 미생물 군집의 개수 arr = [list(map(int, input().split())) for _ in range(K)] for _..

문제 : SWEA 1861. 정사각형방2 난이도 : D4 언어 : python 문제 링크 : https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5LtJYKDzsDFAXc def bfs(y, x): queue = [] room_lst = [] queue.append((y, x)) room_lst.append(arr[y][x]) visited[y][x] = 1 while queue: cy, cx = queue.pop(0) for dy, dx in [(-1, 0), (1, 0), (0, 1), (0, -1)]: ny, nx = cy + dy, cx + dx if 0

문제 : Contact 난이도 : D4 언어 : python 문제 링크 : https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV15B1cKAKwCFAYD&categoryId=AV15B1cKAKwCFAYD&categoryType=CODE&problemTitle=1238&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1 def bfs(s): queue = [s] visited[s] = 0 while queue: x = queue.pop(0) for i in graph[x]: if visited[i] == 0: visited[i]..

문제 링크 - https://swexpertacademy.com/main/learn/course/lectureProblemViewer.do def start(): for i in range(N): for j in range(N): if arr[i][j] == '2': return i, j else: return -1 -1 def bfs(y, x): queue = [] queue.append((y, x)) visited[y][x] = 1 while queue: cy, cx = queue.pop(0) if arr[cy][cx] == '3': return visited[cy][cx] - 2 for dy, dx in [(1, 0), (-1, 0), (0, 1), (0, -1)]: ny, nx = cy + dy,..