-
Notifications
You must be signed in to change notification settings - Fork 1
/
Tar08.cpp
77 lines (72 loc) · 1.37 KB
/
Tar08.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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/*
Alumno: Gerardo Mauricio Gutiérrez Quintana
Matricula: A00815174
Tarea 8 Audiophobia
*/
#include <iostream>
#include <climits>
using namespace std;
int D[105][105]; // Matriz de adyacentes
int resultado[105];
int n;
void initMatrix(){
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
D[i][j] = INT_MAX;
}
D[i][i] = 0;
}
}
void floyd(){
for (int k = 1; k <= n; k++){
for (int i = 1; i <= n; i++){
for (int j = 1; j <= n; j++){
D[i][j] = min(D[i][j], max(D[i][k], D[k][j]));
}
}
}
}
int main(){
int cases, m, q, Ai, Bi, Ci, aux = 1, cont = 1, indice = 1;
cin >> cases;
while (cases > 0){
cin >> n >> m >> q;
aux += q;
initMatrix();
for (int i = 1; i <= m; i++){
cin >> Ai >> Bi >> Ci;
D[Ai][Bi] = Ci;
D[Bi][Ai] = Ci;
}
floyd();
for (int i = 1; i <= q; i++){
cin >> Ai >> Bi;
if (D[Ai][Bi] == INT_MAX){
resultado[cont] = 0;
}
else{
resultado[cont] = D[Ai][Bi];
}
cont++;
}
resultado[q + 1] = -1;
cont++;
cases--;
}
cout << endl;
for (int i = 1; i <= aux; i++){
if (i == 1){
cout << "Case " << indice << ": " << endl;
indice++;
}
else if (resultado[i] == -1){
cout << "Case " << indice << ": " << endl;
indice++;
}
if (resultado[i] == 0){
cout << "No path" << endl;
}
if (resultado[i] != 0 && resultado[i] != -1)
cout << resultado[i] << endl;
}
}