짱우로그

17822 - 원판 돌리기 📝문제 ​👨‍💻코드 from collections import deque import copy n, m, t = map(int, input().split()) graph = [] for _ in range(n): graph.append(deque(list(map(int, input().split())))) arr = [] for _ in range(t): arr.append(list(map(int, input().split()))) temp = [] for _ in range(n): temp.append([0] * m) def solution(): answer = 0 for i in range(t): x, d, k = arr[i] cycle(x, d, k) check() for..

16236 - 아기 상어 📝문제 ​👨‍💻코드 from collections import deque import copy n = int(input()) graph = [] for _ in range(n): graph.append(list(map(int, input().split()))) temp = [] for _ in range(n): temp.append([0] * n) dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] baby = [] size = 2 cnt = 0 for x in range(n): for y in range(n): if graph[x][y] == 9: baby.append(x) baby.append(y) def solution(): answer = 0 while T..

14890 - 경사로 📝문제 👨‍💻코드 import copy n, l = map(int, input().split()) graph = [] for _ in range(n): graph.append(list(map(int, input().split()))) answer = 0 arr = [] for _ in range(n): arr.append([0] * n) def solution(): global graph check() temp = [] for i in zip(*graph): temp.append(list(i)) graph = temp check() return answer def check(): global answer visited = copy.deepcopy(arr) for x in range(..

20058 - 마법사 상어와 파이어스톰 📝문제 👨‍💻코드 from collections import deque import copy n, q = map(int, input().split()) graph = [] for _ in range(2 ** n): graph.append(list(map(int, input().split()))) arr = list(map(int, input().split())) temp = [] for _ in range(2 ** n): temp.append([0] * (2 ** n)) answer = 0 answer2 = 0 visited = [] for _ in range(2 ** n): visited.append([0] * (2 ** n)) def solution(): for..

20056 - 마법사 상어와 파이어볼 📝문제 👨‍💻코드 import copy n, m, k = map(int, input().split()) fire = [] for i in range(m): fire.append(list(map(int, input().split()))) graph = [] for _ in range(n): graph.append([]) for i in range(n): for j in range(n): graph[i].append([]) graph2 = [] for _ in range(n): graph2.append([]) for i in range(n): for j in range(n): graph2[i].append([]) for i in range(len(fire)): r, c,..

17779 - 게리멘더링 2 📝문제 👨‍💻코드 import copy n = int(input()) graph = [[]] for _ in range(n): graph.append([0] + list(map(int, input().split()))) visited = [] for _ in range(n + 1): visited.append([0] * (n + 1)) num = [0] * 5 def solution(): answer = 1e9 for x in range(1, n + 1): for y in range(1, n + 1): for d1 in range(1, n + 1): for d2 in range(1, n + 1): if 1

17142 - 연구소 3 📝문제 👨‍💻코드 from itertools import combinations from collections import deque import copy n, m = map(int, input().split()) graph = [] for _ in range(n): graph.append(list(map(int, input().split()))) b = [] for x in range(n): for y in range(n): if graph[x][y] == 2: b.append([x, y]) virus = list(combinations(b, m)) temp = [] aCnt = 0 for _ in range(n): temp.append([0] * n) for x in rang..

17140 - 이차원 배열과 연산 📝문제 👨‍💻코드 r, c, k = map(int, input().split()) arr = [] for _ in range(3): arr.append(list(map(int, input().split()))) def solution(): answer = 0 if r

17144 - 미세먼지 안녕! 📝문제 👨‍💻코드 import copy r, c, t = map(int, input().split()) graph = [] for _ in range(r): graph.append(list(map(int, input().split()))) temp = [] spot = [] for _ in range(r): temp.append([0] * c) for i in range(len(graph)): for j in range(len(graph[0])): if graph[i][j] == -1: spot.append([i, j]) def solution(): answer = 0 for _ in range(t): spread() upMove() downMove() for x in ra..

16235 - 나무 재테크 📝문제 👨‍💻코드 from collections import deque n, m, k = map(int, input().split()) yb = [] for i in range(n): yb.append([5] * n) add = [] for i in range(n): add.append(list(map(int, input().split()))) namu = [] for i in range(n): namu.append([]) for i in range(n): for j in range(n): namu[i].append(deque([])) for i in range(m): x, y, z = map(int, input().split()) namu[x - 1][y - 1].append..