Merge pull request #169 from AlgoLeadMe/41-pknujsp

41-pknujsp
AlgoLeadMe · May 3, 2024 · c124bfa · c124bfa
2 parents 0d347be + b13d92f
commit c124bfa
Show file tree

Hide file tree

Showing 2 changed files with 35 additions and 1 deletion.
diff --git a/pknujsp/README.md b/pknujsp/README.md
@@ -41,4 +41,5 @@
 | 37차시 | 2024.03.04 |      구현       |         [n+1 카드게임](https://school.programmers.co.kr/learn/courses/30/lessons/258707)          | [#149](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/149) |
 | 38차시 | 2024.03.08 |   BRUTE_FORCE   |         [자물쇠와 열쇠](https://school.programmers.co.kr/learn/courses/30/lessons/60059)          | [#154](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/154) |
 | 39차시 | 2024.03.19 |       큐        |        [디스크 컨트롤러](https://school.programmers.co.kr/learn/courses/30/lessons/42627)         | [#163](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/163) |
-| 40차시 | 2024.03.22 |     그리디      |                           [센서](https://www.acmicpc.net/problem/2212)                            | [#168](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/168) |
+| 40차시 | 2024.03.22 |     그리디      |                           [센서](https://www.acmicpc.net/problem/2212)                            | [#168](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/168) |
+| 41차시 | 2024.03.25 |   다익스트라    |                         [알고스팟](https://www.acmicpc.net/problem/1261)                          | [#169](https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/169) |
diff --git a/pknujsp/다익스트라/41-알고스팟.py b/pknujsp/다익스트라/41-알고스팟.py
@@ -0,0 +1,33 @@
+from heapq import *
+from sys import *
+
+C, R = map(int, stdin.readline().split())
+arr = [list(map(int, list(stdin.readline().strip()))) for _ in range(R)]
+
+drc = ((1,0),(-1,0),(0,1),(0,-1))
+visited = [[False] * C for _ in range(R)]
+heap = [(0, 0, 0)]
+target_r = R - 1
+target_c = C - 1
+
+while heap:
+    cost, r, c = heappop(heap)
+
+    if r == target_r and c == target_c:
+        print(cost)
+        break
+    if visited[r][c]:
+        continue      
+
+    visited[r][c] = True
+
+    for dr, dc in drc:
+        nr = r + dr
+        nc = c + dc
+
+        if not 0 <= nr < R or not 0 <= nc < C:
+            continue
+        if visited[nr][nc]:
+            continue
+
+        heappush(heap, (cost + arr[nr][nc], nr, nc))