POJ 3114 Countries in War

Countries in War

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 3722		Accepted: 1079

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, O and 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

题意：给你一些点与及一些单向有权边组成的一个图，如果图上的两个点能够相互到达那么它们之间的权值为0，否则是从其中
一个点到另一个点所走过边的权值之和，询问从一个点到另一个点的最小权值。
这个题就是明显的强连通+最短路问题
做法：
首先进行强连通缩点（不会强连通的建议去看刘汝佳老师的《算法竞赛入门经典训练指南》，网上关于强连通的博都有点难看懂），
然后对缩点后的点进行新一轮的建图（此时可能会有重边，可以去重留下权值最小的边，也可以不管），然后用Dijkstra每次
找出两点间的最小权值
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <stack>
#include <queue>
using namespace std;
const int maxn = 507;
const int inf = 0x3f3f3f3f;
typedef pair<int, int> pp;
int pre[maxn], low[maxn], scc[maxn], scc_cnt, _clock;
int vis[maxn][maxn], dis[maxn];
bool flag[maxn];
vector<pp> edge[maxn], GG[maxn];
stack<int> S;
struct node{
    int dd, to;
    bool operator<(const node &t)const{
        return dd > t.dd;
    }
    bool operator>(const node &t)const{
        return dd < t.dd;
    }
};

void init(int n){ /// 初始化
    for(int i = 1; i <= n; i ++){
        edge[i].clear();
        GG[i].clear();
    }
    memset( pre, 0, sizeof( pre));
    memset( low, 0, sizeof( low));
    memset( scc, 0, sizeof( scc));
    memset( vis, inf, sizeof( vis));
    while(!S.empty()) S.pop();
    scc_cnt = _clock = 0;
}

void DFS(int st){ // 此处为DFS强连通缩点
    pre[st] = low[st] = ++ _clock;
    S.push(st);
    int tt = edge[st].size();
    for(int i = 0; i < tt; i ++){
        int temp = edge[st][i].first;
        if(!pre[temp]){
            DFS(temp);
            low[st] = min(low[st], low[temp]);
        }
        else if(!scc[temp]){
            low[st] = min(low[st], pre[temp]);
        }
    }
    if(low[st] == pre[st]){
        ++ scc_cnt;
        while(S.top() != st){
            scc[S.top()] = scc_cnt;
            S.pop();
        }
        scc[st] = scc_cnt;
        S.pop();
    }
}

int main(){
    int n, m, k, x, y, z;
    while(~scanf("%d %d", &n, &m) && n){
        init(n);
        for(int i = 1; i <= m; i ++){
            scanf("%d %d %d", &x, &y, &z);
            edge[x].push_back(pp(y, z));
        }
        for(int i = 1; i <= n; i ++){
            if(!pre[i]) DFS(i);
        }
        for(int i = 1; i <= n; i ++){
            int tt = edge[i].size();
            for(int j = 0; j < tt; j ++){
                int l = edge[i][j].first, r = edge[i][j].second;
                if(scc[i] != scc[l]){
                    vis[scc[i]][scc[l]] = min(vis[scc[i]][scc[l]], r);
                }
            }
        }
        for(int i = 1; i <= scc_cnt; i ++)// 去重边
            for(int j = 1; j <= scc_cnt; j ++)
                if(vis[i][j] != inf){
                    GG[i].push_back(pp(j, vis[i][j]));
                }
        void Dij(int st, int en);
        scanf("%d", &k);
        for(int i = 1; i <= k; i ++){
            scanf("%d %d", &x, &y);
            if(scc[x] == scc[y]) printf("0\n"); /// 如果两个点在同一个连通块内
            else Dij(scc[x], scc[y]); /// 不在同一连通块内
        }
        printf("\n");
    }
    return 0;
}

void Dij(int st, int en){ // Dijkstra最短路算法
    priority_queue<node> qaq;
    memset( dis, inf, sizeof( dis));
    memset( flag, false, sizeof( flag));
    dis[st] = 0;
    qaq.push(node{0, st});
    while(!qaq.empty()){
        node temp = qaq.top();
        qaq.pop();
        if(temp.to == en){
            printf("%d\n", temp.dd);
            return;
        }
        int u = temp.to;
        if(flag[u]) continue;
        flag[u] = true;
        int tt = GG[u].size();
        for(int i = 0; i < tt; i ++){
            int l = GG[u][i].first, r = GG[u][i].second;
            if(!flag[l] && dis[l] > dis[u] + vis[u][l]){
                dis[l] = dis[u] + vis[u][l];
                qaq.push(node{dis[l], l});
            }
        }
    }
    printf("Nao e possivel entregar a carta\n");
}