Skip to content

Commit 9bb5c65

Browse files
committed
105차 1번 문제 풀이 (메모리 초과)
1 parent 2372c94 commit 9bb5c65

1 file changed

Lines changed: 35 additions & 0 deletions

File tree

Lines changed: 35 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
import sys
2+
3+
input = sys.stdin.readline
4+
5+
6+
# 도시 개수, 도로 개수, 거리 정보, 출발 도시
7+
n, m, k, x = map(int, input().split())
8+
distance = [[float('inf')] * (n + 1) for _ in range(n + 1)]
9+
10+
for _ in range(m):
11+
a, b = map(int, input().split())
12+
distance[a][b] = 1
13+
14+
for mid in range(n + 1):
15+
for i in range(n + 1):
16+
for j in range(n + 1):
17+
if i == j: continue
18+
if distance[i][mid] != float('inf') and distance[mid][j] != float('inf'):
19+
distance[i][j] = min(distance[i][j], distance[i][mid] + distance[mid][j])
20+
21+
print(distance[x])
22+
if k not in distance[x]:
23+
print(-1)
24+
for dist in distance[x]:
25+
if dist == k:
26+
print(distance[x].index(dist))
27+
28+
29+
"""
30+
4 4 2 1
31+
1 2
32+
1 3
33+
2 3
34+
2 4
35+
"""

0 commit comments

Comments
 (0)