[D4] Title: [S/W 문제해결 응용] 4일차 - 보급로, Time: 151 ms, Memory: 64,000 KB -BaekjoonHub

Author: wlsgur11

SWEA/D4/1249. ［S／W 문제해결 응용］ 4일차 － 보급로/README.md

@@ -0,0 +1,15 @@
+# [D4] [S/W 문제해결 응용] 4일차 - 보급로 - 1249 
+
+[문제 링크](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV15QRX6APsCFAYD) 
+
+### 성능 요약
+
+메모리: 64,000 KB, 시간: 151 ms, 코드길이: 835 Bytes
+
+### 제출 일자
+
+2025-05-24 12:38
+
+
+
+> 출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SWEA/D4/1249. ［S／W 문제해결 응용］ 4일차 － 보급로/［S／W 문제해결 응용］ 4일차 － 보급로.py

@@ -0,0 +1,36 @@
+from collections import deque
+
+def bfs(graph):
+    N = len(graph)
+    visited = [[float('inf')] * N for _ in range(N)]
+    visited[0][0] = 0
+    q = deque([(0, 0)])
+
+    dx = [1, -1, 0, 0]
+    dy = [0, 0, 1, -1]
+
+    while q:
+        x, y = q.popleft()
+        
+        if x == N-1 and y == N-1:
+            continue
+
+        for i in range(4):
+            nx = x + dx[i]
+            ny = y + dy[i]
+
+            if 0 <= nx < N and 0 <= ny < N:
+                new_time = visited[x][y] + graph[nx][ny]
+                if new_time < visited[nx][ny]:
+                    visited[nx][ny] = new_time
+                    q.append((nx, ny))
+                
+    return visited[N-1][N-1]
+
+T = int(input())
+
+for tc in range(1, T+1):
+    N = int(input())
+    graph = [list(map(int, input())) for _ in range(N)]
+
+    print(f"#{tc} {bfs(graph)}")