competitive-programming/solved-uva/10048.cpp at master · the-redback/competitive-programming · 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
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */
#include <bits/stdc++.h>
using namespace std;

#define mem(a, b) memset(a, b, sizeof(a))
#define pb        push_back
#define pp        pop_back
#define inf       1000000000
#define NN        100

int pr[NN + 7];
int a[NN + 7][NN + 7];

int main() {
    // freopen("C:\\Users\\Maruf Tuhin\\Desktop\\in.txt","r",stdin);
    // ios_base::sync_with_stdio(false);
    int i, j, k, l, n, r, c, count;
    int tc, t = 1;
    int u, v, w;
    // scanf("%d",&tc);
    while (~scanf("%d%d%d", &n, &r, &l)) {
        if (n == 0 && r == 0 && l == 0) return 0;
        for (i = 0; i <= n; i++) {
            for (j = 0; j <= n; j++) a[i][j] = inf;
            a[i][i] = 0;
        }
        while (r--) {
            scanf("%d%d%d", &u, &v, &w);
            a[u][v] = w;
            a[v][u] = w;
        }
        for (k = 1; k <= n; k++)
            for (i = 1; i <= n; i++)
                for (j = 1; j <= n; j++) a[i][j] = min(a[i][j], max(a[i][k], a[k][j]));
        if (t != 1) puts("");
        printf("Case #%d\n", t++);
        while (l--) {
            scanf("%d%d", &n, &r);
            int sum = a[n][r];
            if (sum >= inf)
                puts("no path");
            else
                printf("%d\n", sum);
        }
    }
    return 0;
}