2024-05-22

tgyuuAn/README.md

@@ -60,4 +60,5 @@
 | 53차시 | 2024.05.09 |  백트래킹  | <a href="https://www.acmicpc.net/problem/12100">2048 (Easy)</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/184
 | 54차시 | 2024.05.14 |  다익스트라  | <a href="https://www.acmicpc.net/problem/9370">미확인 도착지</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/185
 | 55차시 | 2023.05.18 |  유니온 파인드  | <a href="https://www.acmicpc.net/problem/4195">친구 네트워크</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/189
+| 56차시 | 2023.05.18 |  BFS | <a href="https://www.acmicpc.net/problem/17836">공주님을 구해라!</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/193
 ---

tgyuuAn/힙/공주님을 구해라!.py

@@ -0,0 +1,43 @@
+from heapq import *
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+N, M, T = map(int, input().split())
+board = []
+
+for _ in range(N):
+    board.append(input().split())
+
+dx = [0, 0, -1, 1]
+dy = [-1, 1, 0, 0]
+heap = [(0, 0, 0)]
+answer = int(1e9)
+visited = {(0,0),}
+while heap:
+    now_time, now_row, now_col = heappop(heap)
+
+    if now_row == N-1 and now_col == M-1:
+        answer = min(answer, now_time)
+        break
+
+    if now_time >= T: continue
+
+    for dir in range(4):
+        new_row = now_row + dy[dir]
+        new_col = now_col + dx[dir]
+
+        if new_row < 0 or new_row >= N: continue
+        if new_col < 0 or new_col >= M: continue
+        if (new_row, new_col) in visited: continue
+
+        if board[new_row][new_col] == "2":
+            heappush(heap, (now_time+1, new_row, new_col))
+            answer = min(answer, (now_time+1+(N-1-new_row)+(M-1-new_col)))
+
+        elif board[new_row][new_col] == "0":
+            heappush(heap, (now_time+1, new_row, new_col))
+
+        visited.add((new_row, new_col))
+
+print(answer) if answer <= T else print("Fail")