POJ 1125 Stockbroker Grapevine

Posted on | In | 阅读

Floyd

C++ Code

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
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#define M 101
#define INF 1000000

using namespace std;

int arr[M][M];

int main(){
    int num, contact;
    int to, cost;
    while(scanf("%d", &num) && num != 0){
        for(int i = 1; i <= num; i++){
            for(int j = 1; j <= num; j++){
                if(i == j)
                    arr[i][j] = 0;
                else
                    arr[i][j] = INF;
            }
        }
        for(int i = 1; i <= num; i++){
            scanf("%d", &contact);
            for(int j = 0; j < contact; j++){
                scanf("%d%d", &to, &cost);
                arr[i][to] = cost;
            }

        }
        for(int k = 1; k <= num; k++){
            for(int i = 1; i <= num; i++){
                for(int j = 1; j <= num; j++){
                    arr[i][j] = min(arr[i][j], arr[i][k] + arr[k][j]);
                }
            }
        }
        bool flag = false;
        int mi = INF;
        int pos;
        for(int i = 1; i <= num; i++){
            flag = false;
            int mx = -1;
            for(int j = 1; j <= num; j++){
                if(arr[i][j] >= INF){
                    flag = true;
                    break;
                }
                mx = max(mx, arr[i][j]);
            }
            if(flag == false && mi > mx){
                mi = mx;
                pos = i;
            }
        }
        if(mi == INF)
            printf("disjoint\n");
        else
            printf("%d %d\n", pos, mi);
    }
    return 0;
}