[BOJ] 녹색 옷 입은 애가 젤다지? / 골드4 / 60분 힌트

https://www.acmicpc.net/problem/4485

Author: YoonYn9915

YoonYn9915/Graph/2024-02-01[백준]-#4485-녹색 옷 입은 애가 젤다지.py

@@ -0,0 +1,46 @@
+import sys
+input = sys.stdin.readline
+import heapq
+dx = [-1, 0 ,1 ,0]
+dy = [0, 1, 0, -1]
+inf = int(1e9)
+
+def dijkstra(t, graph, dist):
+    que = []
+    dist[0][0] = graph[0][0]
+
+    heapq.heappush(que, (dist[0][0], 0, 0))
+
+    while que:
+        cost, x, y = heapq.heappop(que)
+
+        if dist[x][y] < cost:
+            continue
+
+        for i in range(4):
+            nx = dx[i] + x
+            ny = dy[i] + y
+            if n > nx >= 0 and n > ny >= 0 :
+                temp = cost + graph[nx][ny]
+                if temp < dist[nx][ny]:
+                    dist[nx][ny] = temp
+                    heapq.heappush(que, (temp, nx, ny))
+
+    print('Problem {}: {}'.format(t, dist[n - 1][n - 1]))
+
+
+t = 1
+
+while 1:
+    n = int(input())
+    graph = []
+    if not n:
+        break
+
+    for i in range(n):
+        graph.append(list(map(int, input().split())))
+
+    dist = [[inf for i in range(n)] for j in range(n)]
+    dijkstra(t, graph, dist)
+
+    t += 1