poj3114Countries in War(强连通缩点+最短路)

Countries in War

Time Limit: 1000MS		Memory Limit: 65536K

Description

In the year 2050, after different attempts of the UN to maintain peace in the world, the third world war broke out. The importance of industrial, commercial and military secrets obliges all the countries to use extremely sophisticated espionage services, so that each city in the world has at least one spy of each country. These spies need to communicate with other spies, informers as well as their headquarters during their actions. Unluckily there doesn’t exist a secure way for a spy to communicate during the war period, therefore the messages are always sent in code so that only the addressee is able to read the message and understand its meaning.

The spies use the only service that functions during the war period, the post. Each city has a postal agency where the letters are sent. The letters can be sent directly to their destination or to other postal agencies, until the letter arrives at the postal agency of the destination city, if possible.

The postal agency in city A can send a printed letter to the postal agency in city B if there is an agreement on sending letters, which determines the time, in hours, that a letter takes to reach city B from city A (and not necessarily the opposite). If there is no agreement between the agencies A and B, the agency A can try to send the letter to any agency so that the letter can reach its destination as early as possible

Some agencies are connected with electronic communication media, such as satellites and optical fibers. Before the war, these connections could reach all the agencies, making that a letter could be sent instantly. But during the period of hostilities every country starts to control electronic communication and an agency can only send a letter to another agency by electronic media (or instantly) if they are in the same country. Two agencies, A and B, are in the same country if a printed letter sent from any one of the agencies can be delivered to the other one.

The espionage service of your country has managed to obtain the content of all the agreements on sending messages existing in the world and desires to find out the minimum time to send a letter between different pairs of cities. Are you capable of helping them?

Input

The input contains several test cases. The first line of each test case contains two integer separated by a space, N (1 ≤ N ≤ 500) and E (0 ≤ E ≤ N²), indicating the numbers of cities (numbered from 1 to N) and of agreements on sending messages, respectively. Following them, then, E lines, each containing three integers separated by spaces, X, Y and H (1 ≤ X, Y ≤ N, 1 ≤ H ≤ 1000), indicating that there exist an agreement to send a printed letter from city X to city Y, and that such a letter will be delivered in H hours.

After that, there will be a line with an integer K (0 ≤ K ≤ 100), the number of queries. Finally, there will be K lines, each representing a query and containing two integers separated by a space, Oand D (1 ≤ O, D ≤ N). You must determine the minimum time to send a letter from city O to city D.

The end of the input is indicated by N = 0.

Output

For each test case your program should produce K lines of output. The I-th line should contain an integer M, the minimum time, in hours, to send a letter in the I-th query. If there aren’t communication media between the cities of the query, you should print “Nao e possivel entregar a carta” (“It’s impossible to deliver the letter”).

Print a blank line after each test case.

Sample Input

4 5
1 2 5
2 1 10
3 4 8
4 3 7
2 3 6
5
1 2
1 3
1 4
4 3
4 1
3 3
1 2 10
2 3 1
3 2 1
3
1 3
3 1
3 2
0 0

Sample Output

0
6
6
0
Nao e possivel entregar a carta

10
Nao e possivel entregar a carta
0

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
using namespace std;
const int INF=20000000;
const int MAXN = 510;
const int MAXM = 251000;
struct Edge
{
    int to,next;
    int cost;
}edge[MAXM];
int head[MAXN],tot;
int Low[MAXN],DFN[MAXN],Stack[MAXN],Belong[MAXN];
int Index,top;
int scc;
int mp[MAXN][MAXN];
bool Instack[MAXN];

void addedge(int u,int v,int cost)
{
    edge[tot].to = v;edge[tot].next = head[u];
    edge[tot].cost=cost;
    head[u] = tot++;
}
void Tarjan(int u)
{
    int v;
    Low[u] = DFN[u] = ++Index;
    Stack[top++] = u;
    Instack[u] = true;
    for(int i = head[u];i != -1;i = edge[i].next)
    {
        v = edge[i].to;
        if(!DFN[v])
        {
            Tarjan(v);
            if(Low[u] > Low[v])
                  Low[u] = Low[v];
        }
        else if(Instack[v] && Low[u] > DFN[v])
            Low[u] = DFN[v];
    }
    if(Low[u] == DFN[u])
    {
        scc++;
        do
        {
            v = Stack[--top];
            Belong[v] = scc;
            Instack[v] = false;
        }
        while( v!= u);
    }
}

struct node{
    int from,to,id;
}e[1000];

bool cmp(node a,node b){
    return a.from<b.from;
}

int dis[MAXN],vis[MAXN];
void dijsktra(int start,int n){
    for(int i=1;i<=n;i++){
        dis[i]=mp[start][i];
        vis[i]=0;
    }
    vis[start]=1;
    int minv,w;
    for(int i=1;i<n;i++){
        minv=INF;
        for(int j=1;j<=n;j++)
            if(!vis[j]&&dis[j]<minv){
                minv=dis[j];
                w=j;
            }
        if(minv>=INF)
            break;
        vis[w]=1;
        for(int j=1;j<=n;j++)
            if(!vis[j]&&dis[w]+mp[w][j]<dis[j])
                dis[j]=dis[w]+mp[w][j];
    }
}
int  ans[MAXN];
void solve(int N)
{
    memset(DFN,0,sizeof(DFN));
    memset(Instack,false,sizeof(Instack));
    Index = scc = top = 0;
    for(int i=1;i<=N;i++)
        if(!DFN[i])
            Tarjan(i);
    for(int i=1;i<=scc;i++)
        for(int j=1;j<=scc;j++){
            if(i==j)
                mp[i][j]=0;
            else
                mp[i][j]=INF;
        }
    for(int u = 1;u <= N;u++)
    {
        for(int i = head[u];i != -1;i = edge[i].next)
        {
            int v = edge[i].to;
            if(Belong[u] != Belong[v])
                mp[Belong[u]][Belong[v]]=min(edge[i].cost,mp[Belong[u]][Belong[v]]);
        }
    }
    int k,u,v;
    scanf("%d",&k);
    for(int i=1;i<=k;i++){
        scanf("%d%d",&u,&v);
        e[i].from=Belong[u],e[i].to=Belong[v];
        e[i].id=i;
    }
    sort(e+1,e+k+1,cmp);
    for(int i=1;i<=k;i++){
        if(i==1){
            dijsktra(e[i].from,scc);
            ans[e[i].id]=dis[e[i].to];
        }
        else if(e[i].from==e[i-1].from)
            ans[e[i].id]=dis[e[i].to];
        else{
            dijsktra(e[i].from,scc);
            ans[e[i].id]=dis[e[i].to];
        }
    }
    for(int i=1;i<=k;i++){
        if(ans[i]==INF)
            printf("Nao e possivel entregar a carta\n");
        else
            printf("%d\n",ans[i]);
    }
    printf("\n");
}
void init()
{
    tot = 0;
    memset(head,-1,sizeof(head));
}
int main()
{
    int n,m,u;
    int v,cost;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==0&&m==0)
            break;
        init();
        for(int i=1;i<=m;i++){
            scanf("%d%d%d",&u,&v,&cost);
            addedge(u,v,cost);
        }
        solve(n);
    }
    return 0;
}