Merge pull request #697 from baekhangyeol/main

[백한결] 106차 라이브 코테 제출

Author: github-actions[bot]

live10/test105/문제1/백한결.py

@@ -0,0 +1,36 @@
+import sys
+from collections import defaultdict, deque
+
+def main():
+    input = sys.stdin.readline
+
+    N, M, K, X = map(int, input().split())
+    graph = defaultdict(list)
+
+    for _ in range(M):
+        A, B = map(int, input().split())
+        graph[A].append(B)
+
+    distance = [-1] * (N + 1)
+    distance[X] = 0
+
+    queue = deque([X])
+
+    while queue:
+        current = queue.popleft()
+
+        for neighbor in graph[current]:
+            if distance[neighbor] == -1:
+                distance[neighbor] = distance[current] + 1
+                queue.append(neighbor)
+
+    result = [i for i in range(1, N + 1) if distance[i] == K]
+
+    if result:
+        for city in sorted(result):
+            print(city)
+    else:
+        print(-1)
+
+if __name__ == "__main__":
+    main()

live10/test106/문제1/백한결.py

@@ -0,0 +1,24 @@
+def main():
+    n = int(input())
+    m = int(input())
+
+    cityMap = [[float('inf')] * n for _ in range(n)]
+
+    for i in range(n):
+        cityMap[i][i] = 0
+
+    for _ in range(m):
+        a, b, c = map(int, input().strip().split())
+        cityMap[a-1][b-1] = min(c, cityMap[a-1][b-1])
+
+
+    for i in range(0, n):
+        for j in range(0, n):
+            for k in range(0, n):
+                cityMap[j][k] = min(cityMap[j][k], cityMap[j][i] + cityMap[i][k])
+
+    for row in cityMap:
+        print(' '.join(str(x if x != float('inf') else 0) for x in row))
+
+if __name__ == "__main__":
+    main()

live10/test106/문제2/백한결.py

@@ -0,0 +1,35 @@
+import heapq
+from collections import defaultdict
+
+def main():
+    n, m = map(int, input().split())
+
+    cityMap = defaultdict(list)
+
+    for _ in range(m):
+        a, b, c = map(int, input().split())
+        cityMap[a].append((b, c))
+        cityMap[b].append((a, c))
+
+    dist = [float('inf')] * (n + 1)
+    dist[1] = 0
+
+    pq = []
+    heapq.heappush(pq, (0, 1))
+
+    while pq:
+        cost, now = heapq.heappop(pq)
+
+        if dist[now] < cost:
+            continue
+
+        for next_node, weight in cityMap[now]:
+            new_cost = cost + weight
+            if new_cost < dist[next_node]:
+                dist[next_node] = new_cost
+                heapq.heappush(pq, (new_cost, next_node))
+
+    print(dist[n])
+
+if __name__ == "__main__":
+    main()

live10/test106/문제3/백한결.py

@@ -0,0 +1,20 @@
+def solution(m, n, puddles):
+    dp = [[0] * (m + 1) for _ in range(n + 1)]
+
+    dp[1][1] = 1
+
+    puddleSet = set()
+
+    for puddle in puddles:
+        puddleSet.add(tuple(puddle))
+
+    for i in range(1, n + 1):
+        for j in range(1, m + 1):
+            if (j, i) in puddleSet:
+                dp[i][j] = 0
+            elif i == 1 and j == 1:
+                continue
+            else:
+                dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % 1000000007
+
+    return dp[n][m]