ICPC NEAU Programming Contest 2020 K. 关键结点 (最短路 + 割点)

解法：

先用最短路求出每个点到点$1$和点$n$的距离$dis1[],dis2[]$；
若点u在最短路上则$dis1[u]+dis2[u]==dis1[n]$
若边$(u,v)$ 在最短路上则 $dis1[u]+w+dis2[v]==dis1[n]$

先求出一定不在最短路上的点
将不在最短路上的边删去后，图中的割点即为出现在所有最短路上的点
剩下的则为出现在部分最短路上的点

Code：

typedef long long ll;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
const int MX = 2e5 + 7;
int n;
ll dis1[MX],dis2[MX];
ll mindis;
int head[MX],cnt;
bool cut[MX<<1];
struct Edge{
	int v,next;
	ll w;
}e[MX << 1];
void add(int u,int v,ll w){
	cut[cnt] = false;
	e[cnt].v = v;
	e[cnt].w = w;
	e[cnt].next = head[u];
	head[u] = cnt++;
}

void SPFA1(){
	bool vis[MX];queue<int>q;while(!q.empty()) q.pop();
	for(int i = 1;i <= n;++i) dis1[i] = LINF, vis[i] = false;
	dis1[1] = 0; vis[1] = true;q.push(1);
	while(!q.empty()){
		int u = q.front();q.pop();
		vis[u] = false;
		for(int i = head[u];~i;i = e[i].next){
			int v = e[i].v;
			ll w = e[i].w;
			if(dis1[v] > dis1[u] + w){
				dis1[v] = dis1[u] + w;
				if(!vis[v]){
					q.push(v);vis[v] = true;
				}
			}
		}
	}
}

void SPFA2(){
	bool vis[MX];queue<int>q;while(!q.empty()) q.pop();
	for(int i = 1;i <= n;++i) dis2[i] = LINF, vis[i] = false;
	dis2[n] = 0; vis[n] = true;q.push(n);
	while(!q.empty()){
		int u = q.front();q.pop();
		vis[u] = false;
		for(int i = head[u];~i;i = e[i].next){
			int v = e[i].v;
			ll w = e[i].w;
			if(dis2[v] > dis2[u] + w){
				dis2[v] = dis2[u] + w;
				if(!vis[v]){
					q.push(v);vis[v] = true;
				}
			}
		}
	}
}


int tim,DFN[MX],LOW[MX];

int key[MX];

void tarjan(int u,int fa){
	DFN[u] = LOW[u] = ++tim;
	for(int i = head[u];~i;i = e[i].next){
		int v = e[i].v;
		if(cut[i] == false || v == fa) continue;
		if(!DFN[v]){
			tarjan(v,u);LOW[u] = min(LOW[u],LOW[v]);
			if(LOW[v] >= DFN[u]) key[u] = 1;
		} else{
			LOW[u] = min(LOW[u],DFN[v]);
		}
	}
}

void block(){
	for(int u = 1;u <= n;++u){
		for(int i = head[u];~i;i = e[i].next){
			int v = e[i].v;
			ll w = e[i].w;
			if(dis1[u] + w + dis2[v] == mindis){
				cut[i] = cut[i^1] = true;
			}
		}
	}
}
void solve(){
	SPFA1();SPFA2();
	mindis = dis1[n];
	for(int i = 1;i <= n;++i){
		if(dis1[i] + dis2[i] == mindis) key[i] = 2;
		else key[i] = 0;
	}
	key[1] = key[n] = 1;
	block();
	tarjan(1,1);
	for(int i = 1;i <= n;++i){
		printf("%d ",key[i]);
	}
	printf("\n");
}

void init(int m){
	cnt = tim = 0;
	for(int i = 1;i <= m+m;++i){
		head[i] = -1;
		cut[i] = false;
	}
	for(int i = 0;i <= n;++i){
		key[i] = 0;
		DFN[i] = LOW[i] = 0;
	}
}
int main(){
	int T;scanf("%d",&T);
	while(T--){
		int m;
		scanf("%d %d",&n,&m);
		init(m);
		for(int i = 1;i <= m;++i){
			int u,v;ll w;scanf("%d %d %lld",&u,&v,&w);
			add(u,v,w);add(v,u,w);
		}
		solve();
	}
	return 0;
}