题目链接1:戳我
题目链接2:戳我
题目链接3:戳我
题目链接4:戳我
链接4是多组数据,请自行改动。
题意请看题目链接~
大致思路:既然要破坏一个点必须破坏保护这个点的节点,那么我记录一下一个点保护哪几个点,保护他的点有几个,这样dist就不光是最短路了,就是能保护这个点的所有点被破坏,在这个前提下的最短时间,通过dijkstra的松弛操作进行改动可以实现这个操作。
核心代码:
松弛操作时:
HeapNode f = q.top();
q.pop();
if(vis[f.u]) continue;
vis[f.u] = 1;
//ff的意思是保护当前点的所有点被破坏,在这种情况下的最短时间
//son是当前节点保护的所有的点,是一个vector,下面有具体代码
//ff表示的是保护她的点全部被破坏的最早时间
for(int i = 0;i < sn[f.u].size();i ++)
{
int v = sn[f.u][i];
fa[v] --;
if(vis[v]) continue;
ff[v] = max(ff[v],dist[f.u]);//虽然是求最短时间,但前提是所有点都破坏,所以这里取Max,多想想有利于理解代码
}
for(int i = head[f.u];i;i = next_[i])
{
int v = edges[i].u;
if(dist[v] > dist[f.u] + edges[i].d)
{
dist[v] = dist[f.u] + edges[i].d;
// cout<<f.u<<" "<<v<<endl;
}
}
//检查所有的点,在开始时dist是INF,然后通过dijkstra的松弛操作会改变dist值,于是和ff取max,时刻想着ff的含义
//
for(int i = 1;i <= n;i ++)
{
if(vis[i]) continue;
dist[i] = max(dist[i],ff[i]);
if(fa[i] == 0)
{
// cout<<i<<endl;
q.push((HeapNode){i,dist[i]});
}
}
完整代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
using namespace std;
const int size = 3010;
const int size2 = 70010;
struct HeapNode{
int u,d;
bool operator < (const HeapNode &rhs) const
{
return d > rhs.d;
}
}edges[size2];
int head[size],next_[size2],tot,dist[size],ff[size],fa[size];
bool vis[size];
vector <int> sn[size];
void init()
{
/* memset(edges,0,sizeof(edges));
memset(head,0,sizeof(head));
memset(next_,0,sizeof(next_));*/
memset(dist,63,sizeof(dist));
/* memset(ff,0,sizeof(ff));
memset(vis,0,sizeof(vis));
memset(fa,0,sizeof(fa));
tot = 0;
for(int i = 1;i <= 3001;i ++) sn[i].clear();*/
}
int n,m;
void RD(int &x)
{
x = 0;char c;c = getchar();
while(c < '0' || c > '9') c = getchar();
while(c >= '0' && c <= '9') x = (x << 1) + (x << 3) + c - '0',c = getchar();
}
void build(int f,int t,int d)
{
edges[++tot].u = t;
edges[tot].d = d;
next_[tot] = head[f];
head[f] = tot;
}
priority_queue <HeapNode> q;
void dijkstra()
{
q.push((HeapNode){1,0});
dist[1] = 0;
while(!q.empty())
{
HeapNode f = q.top();
q.pop();
if(vis[f.u]) continue;
vis[f.u] = 1;
for(int i = 0;i < sn[f.u].size();i ++)
{
int v = sn[f.u][i];
fa[v] --; //
if(vis[v]) continue;
ff[v] = max(ff[v],dist[f.u]);
}
for(int i = head[f.u];i;i = next_[i])
{
int v = edges[i].u;
if(dist[v] > dist[f.u] + edges[i].d)
{
dist[v] = dist[f.u] + edges[i].d;
// cout<<f.u<<" "<<v<<endl;
}
}
//
for(int i = 1;i <= n;i ++)
{
if(vis[i]) continue;
dist[i] = max(dist[i],ff[i]);
if(fa[i] == 0)
{
// cout<<i<<endl;
q.push((HeapNode){i,dist[i]});
}
}
}
}
int main()
{
init();
RD(n),RD(m);
for(int i = 1;i <= m;i ++)
{
int a,b,c;
RD(a),RD(b),RD(c);
build(a,b,c);
}
for(int i = 1;i <= n;i ++)
{
int a;
RD(a);
fa[i] = a;
for(int j = 1;j <= a;j ++)
{
int b;
RD(b);
sn[b].push_back(i);
}
}
dijkstra();
printf("%d\n",dist[n]);
return 0;
}