做多源最短路,跑每个点到哪个加油站最近,记录每个点是哪个点来的,如果两个点之间有边并且两个点不是从一个点来的,那么两个加油站连一条边,然后跑最小生成树,在树上倍增即可
注意判不联通
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
using namespace std;
#define MAXN 200010
#define MAXM 1010
#define ll long long
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
struct vec{
int to;
int fro;
int v;
};
struct pt{
int v;
int to;
int fro;
pt(int _v,int _to,int _fro){
v=_v;
to=_to;
fro=_fro;
}
friend bool operator <(pt x,pt y){
return x.v>y.v;
}
};
struct edg{
int v1;
int v2;
int v;
friend bool operator <(edg x,edg y){
return x.v<y.v;
}
};
vec mp[MAXN*2];
int tai[MAXN],cnt;
int dis[MAXN],bel[MAXN];
int n,N,m;
priority_queue<pt>q;
int tot;
int f[MAXN];
int p[MAXN];
edg e[MAXN*2];
int dep[MAXN],fa[MAXN][20],mx[MAXN][20];
int rt(int x){
return f[x]==x?x:f[x]=rt(f[x]);
}
inline void be(int x,int y,int z){
mp[++cnt].to=y;
mp[cnt].fro=tai[x];
tai[x]=cnt;
mp[cnt].v=z;
}
inline void bde(int x,int y,int z){
be(x,y,z);
be(y,x,z);
}
void dijkstra(){
int i,x,y,X;
while(!q.empty()){
x=q.top().to;
if(bel[x]){
q.pop();
continue ;
}
bel[x]=q.top().fro;
q.pop();
for(i=tai[x];i;i=mp[i].fro){
y=mp[i].to;
if(bel[y]){
e[++tot].v1=bel[y];
e[tot].v2=bel[x];
e[tot].v=dis[x]+mp[i].v+dis[y];
}else if(dis[y]>dis[x]+mp[i].v){
dis[y]=dis[x]+mp[i].v;
q.push(pt(dis[y],y,bel[x]));
}
}
}
}
void kruskal(){
int i,x,y,z;
for(i=1;i<=tot;i++){
x=e[i].v1;
y=e[i].v2;
z=e[i].v;
if(rt(x)!=rt(y)){
f[rt(y)]=rt(x);
bde(x,y,z);
}
}
}
void dfs(int x){
int i,j,y,t,v;
dep[x]=dep[fa[x][1]]+1;
for(i=tai[x];i;i=mp[i].fro){
y=mp[i].to;
if(!dep[y]){
for(t=x,v=mp[i].v,j=1;t;j++){
fa[y][j]=t;
mx[y][j]=v;
v=max(v,mx[t][j]);
t=fa[t][j];
}
dfs(y);
}
}
}
int ask(int x,int y){
int i;
int re=0;
if(dep[x]<dep[y]){
swap(x,y);
}
for(i=19;i;i--){
if(dep[fa[x][i]]>=dep[y]){
re=max(re,mx[x][i]);
x=fa[x][i];
}
}
for(i=19;i;i--){
if(fa[x][i]!=fa[y][i]){
re=max(re,max(mx[x][i],mx[y][i]));
x=fa[x][i];
y=fa[y][i];
}
}
return x==y?re:max(re,max(mx[x][1],mx[y][1]));
}
int main(){
/*
freopen("data.txt" , "r" , stdin);
freopen("dui.txt","w",stdout);
//*/
int i,x,y,z;
memset(dis,0x3f,sizeof(dis));
scanf("%d%d%d",&n,&N,&m);
for(i=1;i<=N;i++){
scanf("%d",&p[i]);
f[p[i]]=p[i];
dis[p[i]]=0;
q.push(pt(0,p[i],p[i]));
}
for(i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&z);
bde(x,y,z);
}
dijkstra();
memset(tai,0,sizeof(tai));
cnt=0;
sort(e+1,e+tot+1);
kruskal();
for(i=1;i<=N;i++){
if(!dep[p[i]]){
dfs(p[i]);
}
}
scanf("%d",&m);
while(m--){
scanf("%d%d%d",&x,&y,&z);
if(rt(x)!=rt(y)){
printf("NIE\n");
}else{
if(ask(x,y)<=z){
printf("TAK\n");
}else{
printf("NIE\n");
}
}
}
return 0;
}
/*
6 2 6
3 6
6 3 12
1 5 49
2 5 15
6 3 82
4 6 68
4 3 4
1
3 6 63
29593004
*/