알고리즘 기술
워셜
헐랭미
2020. 7. 1. 16:37
기본문제는 : https://www.acmicpc.net/problem/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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
#include <iostream>
#define pii pair<int, int>
#define INF 987654321
using namespace std;
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int v, e;
cin >> v >> e;
int ans[101][101];
for (int i = 1; i <= v; i++)
{
for (int j = 1; j <= v; j++)
{
if (i == j)
ans[i][j] = 0;
else
ans[i][j] = INF;
}
}
int st, en, di;
for (int i = 0; i < e; i++)
{
cin >> st >> en >> di;
if (ans[st][en] > di)
ans[st][en] = di;
}
for (int i = 1; i <= v; i++)
{
for (int j = 1; j <= v; j++)
{
for (int k = 1; k <= v; k++)
ans[j][k] = min(ans[j][k], ans[j][i] + ans[i][k]);
}
}
for (int i = 1; i <= v; i++)
{
for (int j = 1; j <= v; j++)
{
if (ans[i][j] == INF)
cout << 0 << ' ';
else
cout << ans[i][j] << ' ';
}
cout << '\n';
}
}
|
cs |