双连通分量求出了那个点属于哪个双连通分量,那个连通分量包含哪些点,还有那些点是割点
#include<bits/stdc++.h>
using namespace std;
const int maxn=50100*2;
struct edge
{
int u,v;
};
int pre[maxn],iscut[maxn],bccno[maxn],dfs_clock,bcc_cnt;
vector<int> G[maxn],bcc[maxn];
stack<edge> s;
int n;
int dfs(int u,int fa)
{
int lowu=pre[u]=++dfs_clock;
int child=0;
for(int i=0;i<G[u].size();i++)
{
int v=G[u][i];
edge e=edge{u,v};
if(!pre[v])
{
s.push(e);
child++;
int lowv=dfs(v,u);
lowu=min(lowu,lowv);
if(lowv>=pre[u])
{
iscut[u]=true;
bcc_cnt++;bcc[bcc_cnt].clear();
while(true)
{
edge x=s.top();s.pop();
if(bccno[x.u]!=bcc_cnt){bcc[bcc_cnt].push_back(x.u);bccno[x.u]=bcc_cnt;}
if(bccno[x.v]!=bcc_cnt){bcc[bcc_cnt].push_back(x.v);bccno[x.v]=bcc_cnt;}
if(x.u==u&&x.v==v)break;
}
}
}
else if(pre[v]<pre[u]&&v!=fa)
{
s.push(e);
lowu=min(lowu,pre[v]);
}
}
if(fa<0&&child==1)iscut[u]=0;
return lowu;
}
void find_bcc(int m)
{
memset(pre,0,sizeof(pre));
memset(iscut,0,sizeof(iscut));
memset(bccno,0,sizeof(bccno));
dfs_clock=bcc_cnt=0;
for(int i=0;i<=m;i++)
if(!pre[i])dfs(i,-1);
}
int main()
{
//freopen("in.txt","r",stdin);
int u,v,cas=1;
while(scanf("%d",&n)!=EOF,n)
{
int m=-1;
for(int i=0;i<maxn;i++)G[i].clear(),bcc[i].clear();
ID id;
for(int i=0;i<n;i++)
{
scanf("%d%d",&u,&v);
u--,v--;
G[u].push_back(v);
G[v].push_back(u);
m=max(m,max(u,v));
}
find_bcc(m);
long long ans1=0,ans2=1;
for(int i=1;i<=bcc_cnt;i++)
{
int cut_cnt=0;
for(int j=0;j<bcc[i].size();j++)
if(iscut[bcc[i][j]])cut_cnt++;
if(cut_cnt==1)
{
ans1++;
ans2*=(long long)(bcc[i].size()-cut_cnt);
}
}
if(bcc_cnt==1)
{
ans1=2;
ans2=bcc[1].size()*(bcc[1].size()-1)/2;
}
printf("Case %d: %lld %lld\n",cas++,ans1,ans2);
}
return 0;
}
lujialiu
#include<cstdio>
#include<stack>
#include<vector>
#include<map>
#include<algorithm>
#include<cstring>
#include<iostream>
using namespace std;
typedef long long LL;
struct Edge { int u, v; };
const int maxn = 100000 + 10;
int pre[maxn], iscut[maxn], bccno[maxn], dfs_clock, bcc_cnt; // 割顶的bccno无意义
vector<int> G[maxn], bcc[maxn];
stack<Edge> S;
int dfs(int u, int fa) {
int lowu = pre[u] = ++dfs_clock;
int child = 0;
for(int i = 0; i < G[u].size(); i++) {
int v = G[u][i];
Edge e = (Edge){u, v};
if(!pre[v]) { // 没有访问过v
S.push(e);
child++;
int lowv = dfs(v, u);
lowu = min(lowu, lowv); // 用后代的low函数更新自己
if(lowv >= pre[u]) {
iscut[u] = true;
bcc_cnt++; bcc[bcc_cnt].clear();
for(;;) {
Edge x = S.top(); S.pop();
if(bccno[x.u] != bcc_cnt) { bcc[bcc_cnt].push_back(x.u); bccno[x.u] = bcc_cnt; }
if(bccno[x.v] != bcc_cnt) { bcc[bcc_cnt].push_back(x.v); bccno[x.v] = bcc_cnt; }
if(x.u == u && x.v == v) break;
}
}
}
else if(pre[v] < pre[u] && v != fa) {
S.push(e);
lowu = min(lowu, pre[v]); // 用反向边更新自己
}
}
if(fa < 0 && child == 1) iscut[u] = 0;
return lowu;
}
struct ID {
map<int, int> m;
int cnt;
ID():cnt(0) { }
int get(int x) {
if(!m.count(x)) m[x] = cnt++;
return m[x];
}
};
int main() {
int kase = 0, n;
while(scanf("%d", &n) == 1 && n) {
memset(pre, 0, sizeof(pre));
memset(iscut, 0, sizeof(iscut));
memset(bccno, 0, sizeof(bccno));
for(int i = 0; i < n*2; i++) G[i].clear();
dfs_clock = bcc_cnt = 0;
ID id;
for(int i = 0; i < n; i++) {
int u, v;
scanf("%d%d", &u, &v);
u = id.get(u); v = id.get(v);
G[u].push_back(v); G[v].push_back(u);
}
dfs(0, -1); // 调用结束后S保证为空,所以不用清空
cout<<bcc_cnt;
LL ans1 = 0, ans2 = 1;
for(int i = 1; i <= bcc_cnt; i++) {
int cut_cnt = 0;
for(int j = 0; j < bcc[i].size(); j++)
if(iscut[bcc[i][j]]) cut_cnt++;
if(cut_cnt == 1) {
ans1++; ans2 *= (LL)(bcc[i].size() - cut_cnt);
}
}
if(bcc_cnt == 1) {
ans1 = 2; ans2 = bcc[1].size() * (bcc[1].size() - 1) / 2;
}
printf("Case %d: %lld %lld\n", ++kase, ans1, ans2);
}
return 0;
}