[22.02.22] 지금까지 풀었던 것 업로드

Author: par3k

Python_BOJ_2022/14502.py

@@ -0,0 +1,70 @@
+# 연구소
+from collections import deque
+import sys
+sys.setrecursionlimit(100001)
+input = lambda: sys.stdin.readline().rstrip()
+
+n, m = map(int, input().split())
+graph = [list(map(int, input().split())) for _ in range(n)]
+tmp_graph = [[0] * m for _ in range(n)]
+
+# 방향
+dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1]
+
+# 안전지대를 카운트한다
+def safeAreaCnt():
+    cnt = 0
+    for i in range(n):
+        for j in range(m):
+            if tmp_graph[i][j] == 0:
+                cnt += 1
+    
+    return cnt
+
+
+# 바이러스가 퍼진다 - bfs
+def spreadVirus(x, y):
+    queue = deque()
+    queue.append((x, y))
+    while queue:
+        xx, yy = queue.popleft()
+        for i in range(4):
+            nx, ny = xx + dx[i], yy + dy[i]
+            if 0 <= nx < n and 0 <= ny < m:
+                if tmp_graph[nx][ny] == 0:
+                    tmp_graph[nx][ny] = 2
+                    queue.append((nx, ny))
+
+# 벽을 친다 - 재귀
+ans = 0
+def recursive(depth):
+    global ans
+    # 벽을 3개 세웠을 때
+    if depth == 3:
+        # 그 그래프를 임시 그래프에 복사해서
+        for i in range(n):
+            for j in range(m):
+                tmp_graph[i][j] = graph[i][j]
+        
+        # 바이러스가 있는 자리에서 바이러스를 한번 퍼트려본다
+        for i in range(n):
+            for j in range(m):
+                if tmp_graph[i][j] == 2:
+                    spreadVirus(i, j)
+        
+        # 안전 지대의 갯수를 최댓값이 되도록 계속 업데이트
+        ans = max(ans, safeAreaCnt())
+        return
+
+    # 빈공간에 한번 벽을 새워본다
+    for i in range(n):
+        for j in range(m):
+            if graph[i][j] == 0:
+                graph[i][j] = 1
+                depth += 1
+                recursive(depth)
+                graph[i][j] = 0
+                depth -= 1
+
+recursive(0)
+print(ans)

Python_BOJ_2022/15649.py

@@ -0,0 +1,24 @@
+# N과 M(1)
+import sys
+sys.setrecursionlimit(10000001)
+
+n, m = map(int, input().split())
+ans = [0] * m
+chk = [False] * (n + 1)
+
+def recursive(depth):
+    if depth == m:
+        for i in range(m):
+            print(ans[i], end=' ')
+        print()
+        return
+    
+    for i in range(1, n + 1):
+        if chk[i]:
+            continue
+        ans[depth] = i
+        chk[i] = True
+        recursive(depth + 1)
+        chk[i] = False
+
+recursive(0)

Python_BOJ_2022/15650.py

@@ -0,0 +1,18 @@
+# N과 M(2)
+n, m = map(int, input().split())
+ans = [0] * m
+
+def recursive(depth, start):
+    if depth == m:
+        for i in range(m):
+            print(ans[i], end=' ')
+        print()
+        return
+    
+    for i in range(start, n + 1):
+
+        ans[depth] = i
+        recursive(depth + 1, i + 1)
+
+
+recursive(0, 1)

Python_BOJ_2022/15651.py

@@ -1,10 +1,11 @@
 # N과 M(3)
+import sys
 
-n, m = map(int, input().split())
+n, m = map(int, sys.stdin.readline().split())
 
 ans = [0] * (n + 1)
 
-def combination(depth):
+def recursive(depth):
     if depth == m:
         for i in range(m):
             print(ans[i], end=' ')
@@ -13,6 +14,6 @@ def combination(depth):
 
     for i in range(1, n + 1):
         ans[depth] = i
-        combination(depth + 1)
+        recursive(depth + 1)
 
-combination(0)
+recursive(0)

Python_BOJ_2022/15651_2.py

@@ -0,0 +1,17 @@
+# N과 M(3)
+
+n, m = map(int, input().split())
+ans = [0] * m
+
+def recursive(depth):
+    if depth == m:
+        for i in range(m):
+            print(ans[i], end=' ')
+        print()
+        return
+
+    for i in range(1, n + 1):
+        ans[depth] = i
+        recursive(depth + 1)
+
+recursive(0)

Python_BOJ_2022/15652_2.py

@@ -0,0 +1,17 @@
+# N과 M(4)
+
+n, m = map(int, input().split())
+ans = [0] * m
+
+def recursive(depth, start):
+    if depth == m:
+        for i in range(m):
+            print(ans[i], end=' ')
+        print()
+        return
+
+    for i in range(start, n + 1):
+        ans[depth] = i
+        recursive(depth + 1, i)
+
+recursive(0, 1)

Python_BOJ_2022/15655.py

@@ -0,0 +1,20 @@
+# N과 M(6)
+
+n, m = map(int, input().split())
+nums = list(map(int, input().split()))
+nums.sort()
+
+ans = [0] * m
+
+def recursive(depth, start):
+    if depth == m:
+        for i in range(m):
+            print(ans[i], end=' ')
+        print()
+        return
+    
+    for i in range(start, n + 1):
+        ans[depth] = nums[i - 1]
+        recursive(depth + 1, i + 1)
+
+recursive(0, 1)

Python_BOJ_2022/15663.py

@@ -0,0 +1,28 @@
+# N과 M(9)
+
+n, m = map(int, input().split())
+nums = list(map(int, input().split()))
+nums.sort()
+
+chk = [False] * (n + 1)
+ans = [0] * m
+
+def recursive(depth):
+    if depth == m:
+        for i in range(m):
+            print(ans[i], end=' ')
+        print()
+        return
+        
+    tmp_num = 0
+    for i in range(n):
+        if chk[i]:
+            continue
+        elif tmp_num != nums[i]:
+            chk[i] = True
+            ans[depth] = nums[i]
+            tmp_num = nums[i]
+            recursive(depth + 1)
+            chk[i] = False
+
+recursive(0)

Python_BOJ_2022/15686.py

@@ -0,0 +1,43 @@
+# 치킨배달
+import sys
+sys.setrecursionlimit(10000001)
+# (r1, c1) (r2, c2) >> |r1 - r2| + |c1 - c2|
+
+n, m = map(int, input().split()) # 마을 크기 n x n / 치킨집 갯수
+graph = [list(map(int, input().split())) for _ in range(n)]
+
+home, kfc = [], [] # 집과 kfc 좌표 저장할 리스트
+ans = 123456789
+kfc_nums = []
+
+for i in range(n):
+    for j in range(n):
+        if graph[i][j] == 1:
+            home.append((i + 1, j + 1))
+        elif graph[i][j] == 2:
+            kfc.append((i + 1, j + 1))
+
+
+def solve(kfc_num, kfc_cnt): # kfc 몇 호점인지 나타내는 숫자, kfc갯수
+    global ans
+    # 기저조건
+    if kfc_num > len(kfc):
+        return
+    if kfc_cnt == m:
+        tmp = 0
+        for x, y in home:
+            min_distance = 123456789
+            for i in kfc_nums: # 선택된 치킨집들
+                kfc_x, kfc_y = kfc[i]
+                min_distance = min(min_distance, abs(x - kfc_x) + abs(y - kfc_y))
+            tmp += min_distance
+        ans = min(ans, tmp)
+        return
+
+    kfc_nums.append(kfc_num)
+    solve(kfc_num + 1, kfc_cnt + 1)
+    kfc_nums.pop()
+    solve(kfc_num + 1, kfc_cnt)
+
+solve(0, 0)
+print(ans)

Python_BOJ_2022/7576.py

@@ -0,0 +1,44 @@
+# 토마토
+from collections import deque
+
+# 입력
+n, m = map(int, input().split())
+graph = [list(map(int, input().split())) for _ in range(m)]
+dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1]
+
+# 토마토가 익는다
+def find():
+    while queue:
+        xx, yy = queue.popleft()
+        for i in range(4):
+            nx, ny = xx + dx[i], yy + dy[i]
+            if 0 <= nx < m and 0 <= ny < n:
+                if graph[nx][ny] == 0:
+                    graph[nx][ny] = graph[xx][yy] + 1
+                    queue.append((nx, ny))
+
+
+# 토마토 존재하는 위치 체크후, 위치를 덱에 저장
+queue = deque()
+for i in range(m):
+    for j in range(n):
+        if graph[i][j] == 1:
+                queue.append((i, j))
+
+# 토마토를 익혀본다
+find()
+
+# 만약 익지 않은 토마토가 있으면 -1 출력
+for i in range(m):
+    for j in range(n):
+        if graph[i][j] == 0:
+            print(-1)
+            exit()
+
+# 토마토가 전부 익는데 걸리는 시간 확인
+ans = -123456789
+for i in range(m):
+    for j in range(n):
+        ans = max(graph[i][j], ans)
+
+print(ans - 1)