-
Notifications
You must be signed in to change notification settings - Fork 0
/
UVA_00558.cpp
53 lines (42 loc) · 1.17 KB
/
UVA_00558.cpp
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
#include <iostream>
#include <vector>
#include <climits>
using namespace std;
string BellmanFord(int n, vector <int> graph[], vector <int> cost[])
{
int i, j, k, l;
vector <int> dist(n, INT_MAX);
dist[0] = 0;
for (i = 0; i < n - 1; i++)
for (j = 0; j < n; j++)
{
l = graph[j].size();
for (k = 0; k < l; k++)
if (dist[j] != INT_MAX && dist[graph[j][k]] > dist[j] + cost[j][k])
dist[graph[j][k]] = dist[j] + cost[j][k];
}
for (int i = 0; i < n; i++)
for (int j = 0; j < graph[i].size(); j++)
if (dist[i] != INT_MAX && dist[graph[i][j]] > dist[i] + cost[i][j])
return "possible";
return "not possible";
}
int main(void)
{
int i, c, n, m, u, v, w;
cin >> c;
while(c--)
{
cin >> n >> m;
vector <int> graph[n];
vector <int> cost[n];
for(i = 0; i < m; ++i)
{
cin >> u >> v >> w;
graph[u].push_back(v);
cost[u].push_back(w);
}
cout << BellmanFord(n, graph, cost) << endl;
}
return 0;
}