维护两个数组,一个是最早到达的时间,一个是最晚将所有保护装置清空的区间,一个点只有将保护装置清空完才能去更新其他点,然后每次从队首取一个点,让他去更新相邻点以及保护它的点,然后每个点只进入队列一次,所以用了Dij+heap
代码
//By AcerMo
#include<cmath>
#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int M=200500;
struct heap
{
int to,cost;
bool friend operator < (heap a,heap b)
{return a.cost>b.cost;}
}add,now;
priority_queue<heap>q;
int n,m;
int to[M],w[M],nxt[M],head[M],cnt;
int num[M],dis[M],vis[M],bo[3050][120],dii[M];
inline int read()
{
int x=0;char ch=getchar();
while (ch>'9'||ch<'0') ch=getchar();
while (ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
return x;
}
inline void adda(int x,int y,int z)
{
to[++cnt]=y;nxt[cnt]=head[x];w[cnt]=z;head[x]=cnt;
return ;
}
inline void Dij()
{
fill(dis,dis+n+1,2e9);
dis[1]=0;add.to=1;add.cost=0;q.push(add);
while (q.size())
{
now=q.top();q.pop();
if (vis[now.to]) continue;vis[now.to]=1;
int mks=max(dis[now.to],dii[now.to]);
for (int i=head[now.to];i;i=nxt[i])
{
if (dis[to[i]]>mks+w[i])
{
dis[to[i]]=mks+w[i];
add.cost=dis[to[i]];
add.to=to[i];
if (!num[to[i]]) q.push(add);
}
}
for (int i=1;i<=bo[now.to][0];i++)
{
int go=bo[now.to][i];
num[go]--;dii[go]=max(dii[go],mks);
int emm=max(dis[go],dii[go]);
add.cost=emm;add.to=go;
if (!num[go]) q.push(add);
}
}
return ;
}
signed main()
{
n=read();m=read();int x,y,z;
for (int i=1;i<=m;i++)
x=read(),y=read(),z=read(),adda(x,y,z);
for (int i=1;i<=n;i++)
{
num[i]=read();
for (int k=1;k<=num[i];k++)
x=read(),bo[x][++bo[x][0]]=i;
}
Dij();cout<<max(dis[n],dii[n]);
return 0;
}