「洛谷3469」「POI2008」BLO-Blockade【Tarjan求割点】

题目链接

【洛谷传送门】

题解

很显然，当这个点不是割点的时候，答案是$2\ast (n-1)$
如果这个点是割点，那么答案就是两两被分开的联通分量之间求组合数。

代码

#include <bits/stdc++.h>
#define ll long long 
using namespace std;
const int N = 500005;
struct edge {
	int to, nt;
} E[N << 1];
int dfn[N], low[N], H[N], sz[N];
int cnt, ecnt, n, m, __dfn;
ll ans[N];
void add_edge(int u, int v) {
	E[++ ecnt] = (edge){v, H[u]}; 
	H[u] = ecnt;
}
void tarjan(int u) {
	dfn[u] = low[u] = ++ __dfn; 
	int cnt = 0; sz[u] = 1; 
	for (int e = H[u]; e; e = E[e].nt) {
		int v = E[e].to; 
		if (!dfn[v]) {
			tarjan(v); 
			sz[u] += sz[v]; 
			low[u] = min(low[u], low[v]); 
			if (low[v] >= dfn[u]) {
				cnt += sz[v];
				ans[u] += 2ll * sz[v] * (n - cnt - 1);
			}
		} else low[u] = min(low[u], dfn[v]); 
	}
	ans[u] += 2ll * (n - 1);
}
int main() {
	cin >> n >> m;
	for (int i = 1, u, v; i <= m; i ++) {
		scanf("%d%d", &u, &v); 
		add_edge(u, v); 
		add_edge(v, u);
	}
	tarjan(1); 
	for (int i = 1; i <= n; i ++) 
		printf("%lld\n", ans[i]);
	return 0; 
}