Codeforce ：757F - Team Rocket Rises Again（最短路+支配树）

题目链接：https://codeforces.com/problemset/problem/757/F

题目大意：有n个城市，m条无向边，起点为s,问炸掉哪一个点会使得 无法以最短的时间到达的点的数量最多，注意有些点本来就到不了，那些点不算在内。

题解：先跑一遍dijkstra，根据点对关系 $d_u+w_u{,}_v==d_v$ 建有向图，得到的图会是一个DAG。题意转化为：炸掉哪个点使得从s出发沿新构造的DAG无法到达的点最多，满足支配树的定义，直接在DAG上建支配树，然后跑一遍dfs统计支配树上每个点的子节点的数量，取最大值。

（支配树的题似乎都是裸题啊）

#include<bits/stdc++.h>
using namespace std;
#define pll pair<ll,ll>
#define fir first
#define sec second
typedef long long ll;
const ll inf = 1e15 + 10;
const int maxn = 2e5 + 10;
const int mx = 20;
vector<pll> e[maxn];
vector<int> g[maxn],rg[maxn],h[maxn],tmp;
int n,m,s;
ll dis[maxn];
int f[maxn][mx + 2],dep[maxn],ru[maxn],ans[maxn];
void dijkstra(int s) {
	priority_queue<pll,vector<pll>,greater<pll>> q;
	fill(dis,dis + n + 1,inf);
	dis[s] = 0;
	q.push(pll(dis[s],s));
	while(!q.empty()) {
		pll now = q.top();
		int u = now.sec;
		q.pop();
		if(dis[u] < now.fir) continue;
		for(int i = 0; i < e[u].size(); i++) {
			int v = e[u][i].fir;
			ll w = e[u][i].sec;
			if(dis[v] > dis[u] + w) {
				dis[v] = dis[u] + w;
				q.push(pll(dis[v],v));
			}
		} 
	}
}
void tpsort() {
	queue<int> q;
	q.push(0);
	for(int i = 1; i <= n; i++) {
		if(!ru[i] && dis[i] != inf) {
			g[0].push_back(i);rg[i].push_back(0);ru[i]++;
		}
	}
	while(!q.empty()) {
		int top = q.front();
		q.pop();
		tmp.push_back(top);
		for(int i = 0; i < g[top].size(); i++) {
			int v = g[top][i];
			ru[v]--;
			if(!ru[v]) q.push(v);
		} 
	}
}
int lca(int u,int v) {
	if(dep[u] < dep[v]) swap(u,v);
	for(int i = mx; i >= 0; i--) 
		if(dep[f[u][i]] >= dep[v]) u = f[u][i];
	if(u == v) return u;
	for(int i = mx; i >= 0; i--)
		if(f[u][i] != f[v][i]) u = f[u][i],v = f[v][i];
	return f[u][0];
}
void dfs(int u,int fa) {
	ans[u] = 1;
	for(int i = 0; i < h[u].size(); i++) {
		int v = h[u][i];
		if(v == fa) continue;
		dfs(v,u);ans[u] += ans[v];
	}
}
int main() {
	scanf("%d%d%d",&n,&m,&s);
	for(int i = 1; i <= m; i++) {
		int u,v,w;
		scanf("%d%d%d",&u,&v,&w);
		e[u].push_back(pll(v,w));
		e[v].push_back(pll(u,w));
	}
	dijkstra(s);
	for(int i = 1; i <= n; i++) {
		if(dis[i] == inf) continue;
		for(auto it : e[i]) {
			if(dis[i] + it.sec == dis[it.fir]) {
				g[i].push_back(it.fir);
				ru[it.fir]++;
				rg[it.fir].push_back(i);
			}
		}
	}
	tpsort();
	for(int i = 1; i < tmp.size(); i++) {
		int p = tmp[i],y = rg[p][0];
		for(int j = 1; j < rg[p].size(); j++) 
			y = lca(y,rg[p][j]);
		h[y].push_back(p);
		dep[p] = dep[y] + 1;f[p][0] = y;
		for(int i = 1; i <= mx; i++) f[p][i] = f[f[p][i - 1]][i - 1];
	}
	dfs(s,-1);
	int res = 0;
	for(int i = 1; i <= n; i++) {
		if(i == s) continue;
		res = max(res,ans[i]);
	}
	printf("%d\n",res);
	return 0;
}