UVA - 567 Risk flody算法

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define maxn 25#define INF 0x3f3f3f3fint g[maxn][maxn];int main() {int num,temp,mark = 1;while(scanf("%d",&num) != EOF) {printf("Test Set #%d\n",mark++);memset(g,INF,sizeof(g));for(int i = 0; i < num; i++) {scanf("%d", &temp);g[1][temp] = 1;g[temp][1] = 1;}for(int i = 2; i <= 19; i++) {scanf("%d",&num);for(int j = 0; j < num; j++) {scanf("%d",&temp);g[i][temp] = 1;g[temp][i] = 1;}}for(int i = 1; i <= 20 ; i++)g[i][i] = 0;for(int i = 1; i <= 20; i++)for(int j = 1; j <= 20; j++)for(int k = 1; k <= 20; k++)g[j][k] = min(g[j][k],g[j][i]+g[i][k]);int test,start,end;scanf("%d",&test);for(int i = 0 ; i < test; i++){scanf("%d%d",&start,&end);printf("%2d to %2d: %d\n",start,end,g[start][end]);}printf("\n");}return 0;}