BOJ_algorithm/11404.cpp at master · WHO-A-U/BOJ_algorithm · GitHub

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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#define INF 987654321
#define NIL -1
#include<iostream>
#include<algorithm>
using namespace std;
int d[101][101];
int p[101][101];
int main()
{
	int N, M;
	cin >> N >> M;
	for(int i=1;i<=N;i++)
		for (int j = 1; j <= N; j++)
		{
			d[i][j] = INF;
			p[i][j] = NIL;
			if (i == j)
				d[i][j] = 0;
		}

	for (int i = 0; i < M; i++)
	{
		int x, y, z;
		cin >> x >> y >> z;//d[start][end]
		d[x][y] = min(d[x][y],z);
		p[x][y] = x;

	}
	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= N; j++)
		{
			for (int k = 1; k <= N; k++)
			{
				if (d[k][j] > d[k][i] + d[i][j])
				{
					d[k][j] = d[k][i] + d[i][j];
					p[k][j] = p[i][j];
				}
			}
		}
	}

	for (int i = 1; i <= N; i++)
	{
		for (int j = 1; j <= N; j++)
		{
			if (d[i][j] == INF)
			{
				cout << "0 ";
			}
			else
			{
				cout << d[i][j] << " ";
			}
		}
		cout << endl;
	}
}