http://acm.hdu.edu.cn/showproblem.php?pid=6705
题意:给一个有向图,求所有路径中(可以重复走一条边)的第k短边的长度。
思路:先把所有的点的最短出边(u,v,c,id)塞到队列,然后bfs,每次拿出队列里最短边,考虑加边(v的最短出边)或者换边(u的出边的较短边)。一开始bfs塞进去n条,每次bfs都pop()一条,push两条,共n+k条,不会tle,mle。
/* Author : Rshs
* Data : 2019-09-04-13.32
*/
#include<bits/stdc++.h>
using namespace std;
#define FI first
#define SE second
#define LL long long
#define MP make_pair
#define PII pair<int,int>
#define SZ(a) (int)a.size()
const double pai = acos(-1);
const LL mod = 1e9+7;
const int MX = 1e5+5;
vector<PII>g[MX];
int q[MX];
LL ans[MX];
struct no{
int u,v;LL c;int id;
};
bool operator<(const no &x,const no &y) {
return x.c>y.c;
}
void bfs(int mxK,int n){
priority_queue<no>q;
for(int i=1;i<=n;i++) if(SZ(g[i])>0)q.push(no{i,g[i][0].SE,g[i][0].FI,0});
int cnt=0;
while(!q.empty()){
no now=q.top();q.pop();
ans[++cnt]=now.c;
if(cnt==mxK)break;
if(now.id!=SZ(g[now.u])-1) //u的下一条出边
q.push(no{now.u,g[now.u][now.id+1].SE,now.c-(LL)g[now.u][now.id].FI+(LL)g[now.u][now.id+1].FI,now.id+1});
if(SZ(g[now.v]))
q.push(no{now.v,g[now.v][0].SE,now.c+g[now.v][0].FI,0});
}
}
void Main(int avg){
int n,m,Q;scanf("%d%d%d",&n,&m,&Q);
for(int i=1;i<=n;i++)g[i].clear();
for(int i=1;i<=m;i++){
int sa,sb,sc;scanf("%d%d%d",&sa,&sb,&sc);g[sa].push_back(MP(sc,sb));
}
for(int i=1;i<=n;i++) sort(g[i].begin(),g[i].end());
int mxK=1;
for(int i=1;i<=Q;i++) scanf("%d",&q[i]),mxK=max(mxK,q[i]);
bfs(mxK,n);
for(int i=1;i<=Q;i++) cout<<ans[q[i]]<<'\n';
}
int main(){
int cas;cin>>cas;for(int i=1;i<=cas;i++)Main(i);
return 0;
}