带限制的最短路问题
发现每点的最短路只有在所有保护它的点的最短路被处理出来之后才可能被更新
记cnt[i]为保护点i的节点个数
每进入一个城市,将它所保护的城市cnt –;
采用dij,在某点cnt为零时将他入队
问题:不加if(used[u.num])continue为什么是Wa而不是T?
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
#include<vector>
#define INF 1061109567
#define LL long long
using namespace std;
const int MAXN = 100000 + 50;
int n,m,w;
struct edge{
int f,t,v;
}l[MAXN << 1];
int head[MAXN],next[MAXN << 1],tot;
int dis[MAXN];
void init(int n){
for(int i = 1;i <= n;i ++){
head[i] = -1,dis[i] = INF;
}
}
void build(int f,int t,int v){
l[++ tot] = (edge){f,t,v};
next[tot] = head[f];
head[f] = tot;
}
vector <int> pro[MAXN];
vector <int> prod[MAXN];
int cnt[MAXN];
struct zt{
int num,dis;
};
bool operator < (zt a,zt b){
return a.dis > b.dis;
}
priority_queue <zt> q;
bool used[MAXN];
void dij(int x){
dis[x] = 0;
q.push((zt){x,dis[x]});
while(!q.empty()){
zt u = q.top();
q.pop();
if(used[u.num])continue;//if(cnt[u.num] != 0)continue;
used[u.num] = true;
for(int i = 0;i < prod[u.num].size();i ++){
dis[u.num] = max(dis[u.num],dis[prod[u.num][i]]);
}
if(u.num == n)return;
for(int i = 0;i < pro[u.num].size();i ++){
cnt[pro[u.num][i]] --;
if(!cnt[pro[u.num][i]])q.push((zt){pro[u.num][i],dis[pro[u.num][i]]});
}
for(int i = head[u.num];i != -1;i = next[i]){
int t = l[i].t;
if(dis[t] > dis[u.num] + l[i].v){
dis[t] = dis[u.num] + l[i].v;
if(!cnt[t])q.push((zt){t,dis[t]});
}
}
}
}
int x,y,z;
int main(){
scanf("%d%d",&n,&m);
init(n);
for(int i = 1;i <= m;i ++){
scanf("%d%d%d",&x,&y,&z);
build(x,y,z);
}
for(int i = 1;i <= n;i ++){
scanf("%d",&cnt[i]);
for(int j = 1;j <= cnt[i];j ++){
scanf("%d",&w);
pro[w].push_back(i);
prod[i].push_back(w);
}
}
dij(1);
printf("%d",dis[n]);
}