toj_2819.cpp

Tianjin University Online Judge 的80多道题目 .

#include<cstdio>
#define MAXLEN 1010
#define MAXDIS 0x7fffffff
int city[ MAXLEN ][ MAXLEN ];
int n , m , s , t;

int main()
{
    int testCase , city1 , city2 , dis;
    
    scanf( "%d" , &testCase );
    
    while ( testCase-- ){
        scanf( "%d%d%d%d" , &n , &m , &s , &t );
        for( i = 0; i < n; i++ )
            for( j = 0; j < n; j++ )
                city[ i ][ j ] = MAXDIS;
        for( i = 0; i < n; i++ )
            city[ i ][ i ] = 0;
        for( i = 0; i < m; i++ ){
            scanf( "%d%d%d" , city1 , city2 , dis );
            city[ city1 ][ city2 ] = dis;
            city[ city1 ][ city2 ] = dis;
        }
        for( i = 0; i < m; i++ )
            for( j = i; j < m; j++ )