[6주차] / [민장규]

민장규/6주차/[BOJ] 11657.py

@@ -0,0 +1,41 @@
+import sys
+input = sys.stdin.readline
+
+INF = float("inf")
+V, E = map(int, input().split())
+dis = [INF for _ in range(V)]
+dis[0] = 0
+
+edge = []
+for _ in range(E) :
+    edge.append(list(map(int, input().split())))
+
+circle = []
+for i in range(V) :
+    for e in edge :
+        start = e[0] - 1
+        end = e[1] - 1
+        cost = e[2]
+
+        if dis[start] + cost < dis[end] :
+            dis[end] = dis[start] + cost
+
+    if i == V - 1 :
+        for e in edge :
+            start = e[0] - 1
+            end = e[1] - 1
+            cost = e[2]
+
+            if dis[start] + cost < dis[end] :
+                circle.append(end)
+                dis[end] = dis[start] + cost
+
+if len(circle) != 0 :
+    print(-1)
+    exit()
+
+for i in dis[1:] :
+    if i == INF :
+        print(-1)
+    else :
+        print(i)

민장규/6주차/[BOJ] 4485.py

@@ -0,0 +1,22 @@
+INF = 1000000
+
+N = int(input())
+cost = []
+for _ in range(N) :
+    cost.extend(list(map(int, input().split())))
+node = [[0 for _ in range(N*N)] for _ in range(N*N)]
+
+for end in range(N*N) :
+    if end == 0 : 
+        continue
+    elif end % N == 0 :
+        node[end-N][end] = cost[end]
+        node[end][end-N] = cost[end]
+    elif end < N :
+        node[end-1][end] = cost[end]
+        node[end][end-1] = cost[end]
+    else :
+        node[end-N][end] = cost[end]
+        node[end][end-N] = cost[end]
+        node[end-1][end] = cost[end]
+        node[end][end-1] = cost[end]

민장규/6주차/[PRGMS] 49191.py

@@ -0,0 +1,28 @@
+def solution(n, results):
+    answer = 0
+    INF = 1000000
+
+    rank = [[INF for _ in range(n)] for _ in range(n)]
+    for i in range(n) :
+        rank[i][i] = 0
+
+    for i in results :
+        win = i[0] - 1
+        lose = i[1] - 1
+        rank[win][lose] = 1
+
+    for k in range(n) :
+        for i in range(n) :
+            for j in range(n) :
+                rank[i][j] = min(rank[i][j], rank[i][k] + rank[k][j])
+
+    for i in range(n) :
+        canRank = True
+        for j in range(n) :
+            if rank[i][j] == INF and rank[j][i] == INF :
+                canRank = False
+                break
+        if canRank :
+            answer += 1
+
+    return answer