题意很简单,就是tarjan求割点个数
训练时直接网上找了个版搞过去了。。现在来学习学习tarjan,然后把这个题补一遍
嗯,,求割点和桥基本上明白了,后面求删除割点后的双连通分量,或者删除桥后的双连通分量个数什么的,还不是很懂,继续再看~
另外,这里也讲一个关于链式前向星的小知识吧,刚刚学到的,因为,求桥的时候,是直接在那条边上标记为桥,但是边是双向的,一条无向边在链式前向星中有两条边
这两条边是有关系的,假如我们当前边的标号为i,那它的反向边的标号为i^1,所以我们就很方便的能找到某条边的反向边,比vector数组要方便多了
不管你的边的标号是从0开始的还是从1开始的
为什么呢,假设边的标号是从0开始的,那第一条边就是0,1,第二条是1,2,第三条是3,4,,,显然满足这个性质,对于标号从1开始,也当然是满足的
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <string>
#include <fstream>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define maxn 105
#define maxm 10005
struct Edge
{
int to, next;
Edge() :to(0), next(0){}
}edge[maxm];
int tot;
int head[maxn];
void addedge(int u, int v)
{
edge[tot].to = v;
edge[tot].next = head[u];
head[u] = tot++;
}
int N;
bool readint(int &x)
{
bool flag = false;
char ch;
x = 0;
while (ch = getchar())
{
if (ch >= '0'&&ch <= '9')
{
x = x * 10 + ch - '0';
flag = true;
}
else if (flag)
{
if (ch == '\n' || ch == 'r')
return true;
else
return false;
}
}
return false;
}
int dfn[maxn], low[maxn], dfs_clock;
bool iscut[maxn];
int DFS(int u, int fa)
{
int lowu = dfn[u] = ++dfs_clock;
int child = 0;
for (int i = head[u]; i != -1; i = edge[i].next)
{
int v = edge[i].to;
if (dfn[v] == 0)
{
++child;
int lowv = DFS(v, u);
lowu = min(lowv, lowu);
if (lowv >= dfn[u])//割点
{
iscut[u] = true;
}
}
else if (dfn[v] < dfn[u] && v != fa)//建立反向边
{
lowu = min(lowu, dfn[v]);
}
}
if (fa < 0 && child == 1)
iscut[u] = false;
low[u] = lowu;
return lowu;
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
//ios::sync_with_stdio(false);
//cin.tie(0); cout.tie(0);
//ifstream in;
//in.open("input.txt", ios::in);
while (scanf("%d", &N) != EOF)
{
if (N == 0)
break;
tot = 0; memset(head, -1, sizeof(int)*maxn);
int t1, t2;
while (scanf("%d",&t1)!=EOF)
{
if (t1 == 0)
break;
while (1)
{
bool flag = readint(t2);
addedge(t1, t2); addedge(t2, t1);
if (flag)
break;
}
}
dfs_clock = 0;
memset(dfn, 0, sizeof(int)*maxn);
memset(low, 0, sizeof(int)*maxn);
memset(iscut, 0, sizeof(iscut));
DFS(1, -1);
int ans = 0;
for (int i = 1; i <= N; ++i)
{
if (iscut[i])
++ans;
}
printf("%d\n", ans);
}
//while (1);
return 0;
}