[TIL] CSAPP 9์ฅ ๊ณต๋ถ3 - ๊ฐ๋จํ ํ ๋น๊ธฐ(Implicit, first-fit)
1. ์์นจ ๋ฌธ์ ํ์ด 1. 10026๋ฒ - ์ ๋ก์์ฝ import sys from collections import deque N = int(sys.stdin.readline()) graph = [list(sys.stdin.readline().strip()) for _ in range(N)] color_count = 0 color_weakness = 0 dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def bfs(x, y) : #์์ฝ์ด ์๋ ์ฌ๋์ด ๋ณด๋ ๊ตฌ์ญ global color_count, color_weakness queue = deque() visited[x][y] = 1 queue.append((x,y)) while queue : curx, cury = queue.poplef..
2023. 5. 14.
[TIL] C์ธ์ด ๊ณต๋ถํ๊ธฐ
1. ์ฝ๋ refactoring 1. 12891๋ฒ - DNA ๋น๋ฐ๋ฒํธ import sys s, p = map(int, sys.stdin.readline().split()) dna = list(sys.stdin.readline().strip()) # A, C, G, T esssential = list(map(int, sys.stdin.readline().split())) def remove(st) : global a, c, g, t if dna[st] == 'A' : a -= 1 elif dna[st] == 'C' : c -= 1 elif dna[st] == 'G' : g -= 1 elif dna[st] == 'T' : t -= 1 return 0 def add(e) : global a, c, g, t i..
2023. 5. 4.