hdu 3631

 

hdu 3631 -->点我传送<--

 

 

 

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int maxn=305;
const int inf=0x3f3f3f3f;
int n;
int dis[maxn][maxn];
int test[maxn];
void floyd(int u)
{
    for(int i=0;i<=n;i++){
        for(int j=0;j<=n;j++){
            dis[i][j]=min(dis[i][j],dis[i][u]+dis[u][j]);
        }
    }
}
int main()
{
    int m,q,cnt=0;
    while(scanf("%d%d%d",&n,&m,&q)&&(m+n+q)){
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                dis[i][j]=inf;
            }
            dis[i][i]=0;
        }
        while(m--){
            int a,b,c;
            scanf("%d%d%d",&a,&b,&c);
            if(c<dis[a][b]) dis[a][b]=c;
        }
        if(cnt!=0) printf("\n");
        printf("Case %d:\n",++cnt);
        int t,t1,t2,t3;
        memset(test,0,sizeof(test));
        while(q--){
            scanf("%d",&t);
            if(!t){
                scanf("%d",&t1);
                if(test[t1]==0){
                    floyd(t1);
                    test[t1]=1;
                }
                else printf("ERROR! At point %d\n",t1);
            }
            else{
                scanf("%d%d",&t2,&t3);
                if(!test[t2]||!test[t3]) printf("ERROR! At path %d to %d\n",t2,t3);
                else if(dis[t2][t3]!=inf) printf("%d\n",dis[t2][t3]);
                else printf("No such path\n");
            }
        }
    }
    return 0;
}