POJ 3114 Countries in War（强连通分量 最短路）

//
//  main.cpp
//  Richard
//
//  Created by 邵金杰 on 16/8/18.
//  Copyright © 2016年 邵金杰. All rights reserved.
//



#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=500+10;
vector<int> s;
struct edge{
    int v,w;
    edge(int v,int w): v(v),w(w) {}
    bool operator < (const edge &e) const {
        return w>e.w;
    }
};
int map[maxn][maxn],dfn[maxn],low[maxn],instack[maxn],elec[maxn],belong[maxn],vis[maxn];
int color,idex;
int n,m,k;
void Tarjan(int u)
{
    dfn[u]=low[u]=++idex;
    instack[u]=1;
    s.push_back(u);
    for(int v=1;v<=n;v++)
    {
        if(map[u][v])
        {
            if(!dfn[v])
            {
                Tarjan(v);
                low[u]=min(low[u],low[v]);
            }
            else if(instack[v])
            {
                low[u]=min(low[u],dfn[v]);
            }
        }
    }
    if(dfn[u]==low[u])
    {
        int p;
        color++;
        do{
            p=s[s.size()-1];
            s.pop_back();
            instack[p]=0;
            belong[p]=color;
        }while(u!=p);
    }
}
int dijkstra(int s,int t)
{
    memset(vis,0,sizeof(vis));
    priority_queue<edge> pq;
    edge nd(0,0);
    pq.push(edge(s,0));
    while(!pq.empty())
    {
        nd=pq.top();
        pq.pop();
        if(vis[nd.v]) continue;
        vis[nd.v]=1;
        if(nd.v==t) return nd.w;
        
        for(int v=1;v<=n;v++)
        {
            int u=nd.v;
            if(map[u][v])
            {
                edge q(v,0);
                if(vis[q.v]) continue;
                if(belong[u]==belong[v]) q.w=nd.w;
                else q.w=nd.w+map[u][v];
                pq.push(q);
            }
        }
    }
    return -1;
}
int main()
{
    while(scanf("%d%d",&n,&m)&&(n+m))
    {
        color=0,idex=0;
        memset(map,0,sizeof(map));
        memset(dfn,0,sizeof(dfn));
        memset(low,0,sizeof(low));
        memset(elec,0,sizeof(elec));
        memset(belong,0,sizeof(belong));
        memset(instack,0,sizeof(instack));
        int a,b,c;
        for(int i=0;i<m;i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            map[a][b]=c;
        }
        for(int i=1;i<=n;i++)
        {
            if(!dfn[i])
            {
                Tarjan(i);
            }
        }
//        for(int i=1;i<=n;i++)
//            cout<<belong[i]<<" ";cout<<endl;
        scanf("%d",&k);
        for(int i=0;i<k;i++)
        {
            scanf("%d%d",&a,&b);
            int dist;
            dist=dijkstra(a,b);
            if(dist!=-1) printf("%d\n",dist);
            else printf("Nao e possivel entregar a carta\n");
        }
        printf("\n");
    }
    return 0;
}