jzoj5959 铁路运输 最短路dag+dfs

Description

---

给定一个边权为1的无向图，q次修改一条边的边权为2，每次求多少节点到1的最短路变长了

Solution

---

考虑建出原图的最短路dag，我们修改一条dag中的边等价于删掉了它，答案就是1不能到达的点的数量。考虑离线然后倒插入被删掉的边，对于1的连通块染色。由于每个点只会被走一次因此复杂度是线性的

手贱改了一点点结果挂了…

Code

---

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#define rep(i,st,ed) for (int i=st;i<=ed;++i)
#define drp(i,st,ed) for (int i=st;i>=ed;--i)
#define fill(x,t) memset(x,t,sizeof(x))
#define fi first
#define se second

typedef std:: pair <int,int> pair;
const int N=500005;
const int E=500005;

int dis[N];

struct Graph {
	struct edge {int x,y,w,next;} e[E];

	int ls[N],edCnt;

	bool vis[N];

	edge operator [](int x) {
		return e[x];
	}

	void add_edge(int x,int y,int w) {
		e[++edCnt]=(edge) {x,y,w,ls[x]}; ls[x]=edCnt;
	}
} G,T;

int id[N],chp[N],ans[N],lxf[N];
int ls[N],edCnt,wjp,fa[N],sum;

bool vis[N],used[N],col[N];

inline int read() {
	int x=0,v=1; char ch=getchar();
	for (;ch<'0'||ch>'9';v=(ch=='-')?(-1):(v),ch=getchar());
	for (;ch<='9'&&ch>='0';x=x*10+ch-'0',ch=getchar());
	return x*v;
}

void dijk() {
	std:: priority_queue <pair> heap;
	fill(dis,63); dis[1]=0;
	fill(vis,0);
	heap.push(pair(-dis[1],1));
	for (;!heap.empty();) {
		pair top=heap.top(); heap.pop();
		if (vis[top.se]) continue; vis[top.se]=true;
		for (int i=G.ls[top.se];i;i=G[i].next) {
			if (-top.fi+G[i].w<dis[G[i].y]) {
				dis[G[i].y]=-top.fi+G[i].w;
				heap.push(pair(-dis[G[i].y],G[i].y));
			}
		}
	}
}

void dfs(int now) {
	if (col[now]) return ;
	col[now]=1; sum++;
	for (int i=T.ls[now];i;i=T[i].next) {
		if (!used[lxf[i]]) {
			dfs(T[i].y);
		}
	}
}

int main(void) {
	freopen("data.in","r",stdin);
	freopen("myp.out","w",stdout);
	int n=read(),m=read(),q=read();
	rep(i,1,m) {
		int x=read(),y=read();
		G.add_edge(x,y,1);
		G.add_edge(y,x,1);
	}
	dijk();
	rep(i,1,m*2) if (dis[G[i].x]+G[i].w==dis[G[i].y]) {
		T.add_edge(G[i].x,G[i].y,G[i].w);
		lxf[T.edCnt]=i;
		chp[i]=T.edCnt;
	}
	rep(i,1,q) {
		id[i]=read();
		used[id[i]*2-1]=true;
		used[id[i]*2]=true;
	}
	dfs(1);
	ans[q]=sum;
	drp(i,q,1) {
		int x=G[id[i]*2].x,y=G[id[i]*2].y;
		used[id[i]*2-1]=false;
		used[id[i]*2]=false;
		if (chp[id[i]*2]&&col[x]) dfs(y);
		else if (chp[id[i]*2-1]&&col[y]) dfs(x);
		ans[i-1]=sum;
	}
	rep(i,1,q) printf("%d\n", n-ans[i]);
	return 0;
}