Merge pull request #134 from YoonYn9915/main

YoonYn9915 /1월 5주차/3문제

Author: YoonYn9915

YoonYn9915/Graph/2024-02-01-[백준]-#1058-친구.py

@@ -0,0 +1,17 @@
+n = int(input())
+friends = [list(input()) for _ in range(n)]
+
+connected = [[0] * n for _ in range(n)]
+
+for k in range(n):
+    for i in range(n):
+        for j in range(n):
+            if i == j:
+                continue
+            if friends[i][j] == "Y" or (friends[i][k] == "Y" and friends[k][j] == "Y"):
+                connected[i][j] = 1
+
+answer = 0
+for row in connected:
+    answer = max(answer, sum(row))
+print(answer)

YoonYn9915/Graph/2024-02-01[백준]-#1238-파티.py

@@ -0,0 +1,29 @@
+import heapq
+
+def dijkstra(s):
+    D = [float('inf')] * (N+1)
+    D[s] = 0
+    q = []
+    heapq.heappush(q, (0, s))
+    while q:
+        dist, now = heapq.heappop(q)
+        if D[now] >= dist:
+            for v, val in city[now]:
+                if dist + val < D[v]:
+                    D[v] = dist + val
+                    heapq.heappush(q, (dist + val, v))
+    return D
+
+N, M, X = map(int, input().split())
+city = [[] for _ in range(N+1)]
+for _ in range(M):
+    a, b, t = map(int, input().split())
+    city[a].append([b, t])
+ans = dijkstra(X)
+ans[0] = 0
+for i in range(1, N+1):
+    if i != X:
+        res = dijkstra(i)
+        ans[i] += res[X]
+
+print(max(ans))

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