思路很简单,就是模拟,但是有了(克鲁斯卡重构树+最小瓶颈路)后,时间复杂度降为 O ( m l o g m + n l o g n ) O(mlogm+nlogn) O(mlogm+nlogn)
因为LL的问题,拍了一个晚上,我吐了。
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define inf 0x7fffffff
#define ll long long
#define int long long
//#define double long double
#define re int
#define void inline void
#define eps 1e-5
//#define mod 1e9+7
//#define ls(p) p<<1
//#define rs(p) p<<1|1
//#define pi acos(-1.0)
#define pb push_back
#define P pair < int , int >
#define mk make_pair
#define fi first
#define se second
//#define unordered_map map
//#define __int128 long long
using namespace std;
using namespace __gnu_pbds;
const int M=1e18;
const int mod=1e9+7;
const int N=2e6+5;
int n,m,q;
namespace KUL
{
struct nodi
{
int ver,edge,next;
}e[N];
int tot=1,head[N];
int fa[N],cnt;
int d[N],f[N][25],dis[N][25];
void init(int n){for(re i=1;i<=n;i++) fa[i]=i;}
int get(int x){return fa[x]==x?x:fa[x]=get(fa[x]);}
void add(int x,int y,int z)
{
e[++tot].ver=y;
e[tot].edge=z;
e[tot].next=head[x];
head[x]=tot;
}
void addedge(int x,int y,int z)
{
add(x,y,z);add(y,x,z);
}
void merge(int x,int y,int z)
{
int fx=get(x),fy=get(y);
if(fx==fy) return;
fa[fx]=++cnt;
fa[fy]=cnt;
fa[cnt]=cnt;
addedge(x,cnt,z);
addedge(y,cnt,z);
}
int lca(int x,int y)
{
int ans=1e18;
if(d[x]<d[y]) swap(x,y);
for(re i=20;i>=0;i--) if(d[f[x][i]]>=d[y]) ans=min(ans,dis[x][i]),x=f[x][i];
if(x==y) return ans;
for(re i=20;i>=0;i--) if(f[x][i]!=f[y][i]) ans=min(ans,min(dis[x][i],dis[y][i])),x=f[x][i],y=f[y][i];
ans=min(ans,min(dis[x][0],dis[y][0]));
return ans;
}
void dfs(int x,int pre,int last)
{
f[x][0]=pre;dis[x][0]=last;d[x]=d[pre]+1;
for(re i=1;i<=20;i++) f[x][i]=f[f[x][i-1]][i-1],dis[x][i]=min(dis[x][i-1],dis[f[x][i-1]][i-1]);
for(re i=head[x];i;i=e[i].next)
{
int y=e[i].ver;
int z=e[i].edge;
if(y==pre) continue;
dfs(y,x,z);
}
}
}
int order[N],c[N],val[N],id[N];
struct node
{
int x,y,z;
}a[N];
bool cmp(node i,node j)
{
return i.z>j.z;
}
vector < int > ans;
void solve()
{
cin>>n>>m>>q;
for(re i=1;i<=n;i++) scanf("%lld",&order[i]);
KUL::init(n+5);
for(re i=1;i<=n;i++) scanf("%lld",&val[i]);
for(re i=1;i<=m;i++) scanf("%lld%lld%lld",&a[i].x,&a[i].y,&a[i].z);
for(re i=1;i<=q;i++)
{
int x;
scanf("%lld",&x);
a[++m]=(node){n+1,x,M};
}
sort(a+1,a+m+1,cmp);
KUL::cnt=n+1;
for(re i=1;i<=m;i++) KUL::merge(a[i].x,a[i].y,a[i].z);
KUL::dfs(KUL::cnt,0,1e18);
ll now=0;
int la=0;
for(re i=1;i<=n;i++)
{
int x=order[i];
if(i==1)
{
if(val[x]<=0) ans.pb(0);
else now=val[x];
}
else
{
now=min(1ll*KUL::lca(la,x),now);
if(val[x]<=0)
{
ans.pb(min(now,1ll*abs(val[x])));
now=max(0ll,val[x]+1ll*now);
}
else
{
now+=1ll*val[x];
}
}
la=x;
}
for(re i=0;i<ans.size();i++) printf("%d\n",ans[i]);
}
signed main()
{
// fflush(stdout);
// srand(102321547);
// freopen("D.in", "r", stdin);
// freopen("Dout.txt", "w", stdout);
// freopen("9.out", "w", stdout);
int T=1;
// cin>>T;
for(re index=1;index<=T;index++)
{
// printf("Case #%d:\n",index);
solve();
// puts("");
}
return 0;
}
/*
5 2 3
5 2 3 4 1
757894200 915360824 -687211835 -459089780 529875196
1 5 602114496
4 2 565575680
2 3 5
*/