Merge pull request #698 from gmlrude/main

[박희경] 106차 라이브 코테 제출

Author: github-actions[bot]

live10/test106/문제1/박희경.py

@@ -0,0 +1,31 @@
+import sys
+
+
+input = sys.stdin.readline
+
+n = int(input())    # 도시 개수
+m = int(input())    # 버스 개수
+
+graph = [[float('inf')] * n for _ in range(n)]
+for _ in range(m):
+    start, end, cost = map(int, input().split())
+
+    graph[start - 1][end - 1] = min(cost, graph[start - 1][end - 1])
+    
+for k in range(n):
+    for i in range(n):
+        for j in range(n):
+            if i == j: 
+                graph[i][j] = 0
+                continue
+            if graph[i][k] != float('inf') and graph[k][j] != float('inf'):
+                graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j])
+
+for row in graph:
+    res = []
+    for x in row:
+        if x == float('inf'):
+            res.append(0)
+        else:
+            res.append(x)
+    print(*res)

live10/test106/문제2/박희경.py

@@ -0,0 +1,29 @@
+import sys
+import heapq
+
+input = sys.stdin.readline
+
+n, m = map(int, input().split())
+graph = [[] for _ in range(n + 1)]  # 인접리스트 (인접 행렬로 하면 메모리 초과)
+
+for _ in range(m):
+    a, b, c = map(int, input().split())
+    graph[a].append((b, c))        
+    graph[b].append((a, c))
+
+cost = [float('inf')] * (n + 1)
+cost[1] = 0
+heap = [(0, 1)]    # (최소비용, 시작지점) 
+
+# 가중치가 변동이 있다면 우선순위 큐 사용한 다익스트라
+while heap:
+    cur_cost, x = heapq.heappop(heap)
+    if cur_cost > cost[x]:
+        continue
+    for nx, w in graph[x]:          
+        total = cur_cost + w
+        if total < cost[nx]:
+            cost[nx] = total
+            heapq.heappush(heap, (total, nx))
+
+print(cost[n])

live10/test106/문제3/박희경.py

@@ -0,0 +1,30 @@
+def solution(m, n, puddles):
+    graph = [[-1] * m for _ in range(n)]
+
+    graph[0][0] = 1
+    
+    # 웅덩이 체크
+    for x, y in puddles:
+        graph[y - 1][x - 1] = 0
+
+    # 첫 열 초기화 
+    for i in range(1, n):
+        if graph[i][0] == 0:
+            graph[i][0] = 0
+        else:
+            graph[i][0] = graph[i - 1][0]
+
+    # 첫 행 초기화
+    for j in range(1, m):
+        if graph[0][j] == 0:
+            graph[0][j] = 0
+        else:
+            graph[0][j] = graph[0][j - 1]
+            
+    # 웅덩이 제외 경로 계산
+    for i in range(1, n):
+        for j in range(1, m):
+            if graph[i][j] != 0:
+                graph[i][j] = graph[i-1][j] + graph[i][j-1]
+    
+    return graph[n-1][m-1] % 1000000007