poj 1125

#include <iostream>
#include <string.h>
using namespace std;
const int size = 101;
int road[size][size];
const int INF = 0x3f3f3f3f;
int n;
int main(){
    while (scanf("%d", &n)&&n){
        memset(road, INF, sizeof(road));
        for (int i = 0; i < n; ++i) {
            road[i][i] = 0;
        }
        int p, t, x;
        for (int i = 0; i < n; ++i) {
            cin>>x;
            for (int j = 0; j < x; ++j) {
                cin>>p>>t;
                road[i][p-1] = t;
            }
        }
        /**
         * floyd algorithm
         */
        for (int k = 0; k < n; ++k) {
            for (int i = 0; i < n; ++i) {
                for (int j = 0; j < n; ++j) {
                    if (road[i][j]>road[i][k]+road[k][j])
                        road[i][j] = road[i][k]+road[k][j];
                }
            }
        }
        int u, time=INF;
        // find the min' max
        for (int i = 0; i < n; ++i) {
            int temp = 0;
            for (int j = 0; j < n; ++j) {
                if (temp<road[i][j])
                    temp = road[i][j];
            }
            if (time>temp){
                time = temp;
                u = i;
            }
        }
        if (time == INF)
            cout<<"disjoint"<<endl;
        else
            cout<<u+1<<" "<<time<<endl;
    }
}