poj 1125 Stockbroker Grapevine(Folyd)

//nyoj的数据改成了1000 ，然后就跪了。。 好像大神们用spfa做的
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<iomanip>
#include<climits>
#include<string.h>
#include<cmath>
#include<stdlib.h>
#include<vector>
#include<stack>
#include<set>
#define INF 2000000000
#define MAXN 110
#define maxn 1000010
#define Mod 1000007
#define N 1010
using namespace std;
typedef long long LL;

int n, m;
int v, w;
int G[MAXN][MAXN];
int minn, pos;

void Floyd()
{
    for (int k = 1; k <= n; ++k)
        for (int i = 1; i <= n; ++i)
            for (int j = 1; j <= n; ++j)
                if (G[i][k] + G[k][j] < G[i][j])
                    G[i][j] = G[i][k] + G[k][j];
}

void getMin()
{
    int sum;
    minn = maxn;
    pos = 0;
    for (int i = 1; i <= n; ++i) {
        sum = 0;
        for (int j = 1; j <= n; ++j)
            if (i!= j && G[i][j] > sum)
                sum = G[i][j];
        if (minn > sum) {
            minn = sum;
            pos = i;
        }
    }
    
}

int main()
{
    while (~scanf("%d", &n),n) {
        for (int i = 0; i <= n; ++i)
            for (int j = i + 1; j <= n; ++j)
                G[i][j] = G[j][i] = maxn;
        
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &m);
            for (int j = 0; j < m; ++j) {
                scanf("%d%d", &v, &w);
                G[i][v] = w;
            }
        }
        Floyd();
        getMin();
        if (minn == maxn) puts("disjoint");
        else printf("%d %d
",pos,minn);
    }
    return 0;
}