Connections between cities

</pre><pre name="code" class="cpp">#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
const int maxn=10010;
typedef pair<int, int>wuyu;
vector<wuyu> edge[maxn],query[maxn];
int fa[maxn],ans[100*maxn],dis[maxn],anc[maxn];
bool p[maxn];

int father(int x){
    return fa[x]=fa[x]==x?x:father(fa[x]);    
}

void dfs(int u,int d,int an){
    fa[u]=u;
    dis[u]=d;
    p[u]=true;
    anc[u]=an;
    for(int i=0;i<edge[u].size();i++){
        int v=edge[u][i].first;
        int w=edge[u][i].second;
        if(p[v]==false){
            dfs(v,d+w,an);
            fa[v]=u;
            //printf("(%d->%d)\n",u,v);    
        }
    }
    for(int i=0;i<query[u].size();i++){
        int v=query[u][i].first;
        int w=query[u][i].second;
        if(p[v]==true && anc[v]==an){
            ans[w]=dis[u]+dis[v]-2*dis[father(fa[v])];
        }
    }
}

int main(){
    int m,n,k;
    int a,b,c;
    while(scanf("%d%d%d",&n,&m,&k)!=EOF){
        for(int i=1;i<=n;i++){
            edge[i].clear();
            query[i].clear();
        }
        for(int i=1;i<=m;i++){
            scanf("%d%d%d",&a,&b,&c);
            edge[a].push_back(wuyu(b,c));
            edge[b].push_back(wuyu(a,c));
        }
        int x,y;
        for(int i=1;i<=k;i++){
            scanf("%d%d",&x,&y);    
            query[x].push_back(wuyu(y,i));
            query[y].push_back(wuyu(x,i));
        }
        //memset(p,false,sizeof(p));
        memset(ans,-1,sizeof(ans));
        for(int i=1;i<=n;i++){
            if(p[i]==false)    dfs(i,0,i);
        }
        for(int i=1;i<=k;i++){
            if(ans[i]!=-1)printf("%d\n",ans[i]);    
            else printf("Not connected\n");
        }
    }
    return 0;    
}