题意:给n个点,和一个有向图及边权,若两个点可以相互到达,则他们之间的费用可以为0,然后K个询问,问U到V的最小费用
思路:可以相互到达的费用为0,那么直接强联通缩点就行了,然后问最短路,因为询问K最多100,所以可以直接dijkstra一次一次的判断就行了
#include <queue>
#include <vector>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf=0x3f3f3f3f;
const ll INF=0x3f3f3f3f3f3f3f3fll;
const int maxn=510;
int V,m;
vector<int>G[maxn];
vector<int>rG[maxn];
vector<int>vs;
bool used[maxn];
int cmp[maxn];
void add_edge(int from,int to){
G[from].push_back(to);
rG[to].push_back(from);
}
void dfs(int v){
used[v]=1;
for(unsigned int i=0;i<G[v].size();i++){
if(!used[G[v][i]]) dfs(G[v][i]);
}
vs.push_back(v);
}
void rdfs(int v,int k){
used[v]=1;
cmp[v]=k;
for(unsigned int i=0;i<rG[v].size();i++){
if(!used[rG[v][i]]) rdfs(rG[v][i],k);
}
}
int scc(){
memset(used,0,sizeof(used));
vs.clear();
for(int v=0;v<V;v++){
if(!used[v]) dfs(v);
}
memset(used,0,sizeof(used));
int sum=0;
for(int i=vs.size()-1;i>=0;i--){
if(!used[vs[i]]) rdfs(vs[i],sum++);
}
return sum;
}
struct edge{
int to,cost;
edge(int a,int b){to=a;cost=b;}
};
typedef pair<int,int>P;
vector<edge>G1[maxn];
int dis[maxn];
void dijkstra(int s){
priority_queue<P,vector<P>,greater<P> >que;
fill(dis,dis+maxn,inf);
dis[s]=0;que.push(P(0,s));
while(!que.empty()){
P p=que.top();que.pop();
int v=p.second;
if(dis[v]<p.first) continue;
for(unsigned int i=0;i<G1[v].size();i++){
edge e=G1[v][i];
if(dis[e.to]>dis[v]+e.cost){
dis[e.to]=dis[v]+e.cost;
que.push(P(dis[e.to],e.to));
}
}
}
}
int A[300000],B[300000],C[300000];
int main(){
int a,b,q;
while(scanf("%d%d",&V,&m)!=-1){
if(V==0&&m==0) break;
for(int i=0;i<maxn;i++) G[i].clear(),rG[i].clear(),G1[i].clear();
for(int i=0;i<m;i++){
scanf("%d%d%d",&A[i],&B[i],&C[i]);A[i]--;B[i]--;
add_edge(A[i],B[i]);
}
int t=scc();
for(int i=0;i<m;i++){
int aa=cmp[A[i]],bb=cmp[B[i]];
if(aa!=bb) G1[aa].push_back(edge(bb,C[i]));
}
scanf("%d",&q);
while(q--){
scanf("%d%d",&a,&b);
int aa=cmp[a-1],bb=cmp[b-1];
dijkstra(aa);
if(dis[bb]==inf) printf("Nao e possivel entregar a carta\n");
else printf("%d\n",dis[bb]);
}
printf("\n");
}
return 0;
}