/
BAEKJOON 11404
44 lines (42 loc) · 1.18 KB
/
BAEKJOON 11404
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int[][] map = new int[n+1][n+1];
int m = Integer.parseInt(br.readLine());
for (int i = 1; i <=n; i++) {
for (int j = 1; j <= n; j++) {
if(i != j)
map[i][j] = 10000000;
}
}
for (int i = 0; i < m; i++) {
StringTokenizer st = new StringTokenizer(br.readLine());
int y = Integer.parseInt(st.nextToken());
int x = Integer.parseInt(st.nextToken());
int d = Integer.parseInt(st.nextToken());
map[y][x] = Math.min(map[y][x], d);
}
for (int k = 1; k <=n; k++) {
for (int i = 1; i <=n; i++) {
if(k == i) continue;
for (int j = 1; j <=n; j++) {
if(k == j || i == j)continue;
map[i][j] = Math.min(map[i][j], map[i][k]+map[k][j]);
}
}
}
for (int i = 1; i <=n; i++) {
for (int j = 1; j <=n; j++) {
if(map[i][j] >= 10000000)
System.out.print("0 ");
else
System.out.print(map[i][j] + " ");
}
System.out.println();
}
}
}