传送门:
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=251
题目大意:给定连通的无向图,求割点数,裸题。
解题思路:除了输入格式外,直接DFS和运用定理low(v)>=pre(u)即可。
Code:
/* W w w mm mm 222222222 7777777777777 */
/* W w w w m m m m 222 22 7777 */
/* w w w w m m m m 22 777 */
/* w w w w m m m m 22 77 */
/* w w w w m m m m 222 77 */
/* w w w w m m m m 222 77 */
/* w w w w m m m m 222 77 */
/* w w w w m m m m 222 77 */
/* w w w w m m m m 222 77 */
/* ww ww m mm m 222222222222222 77 */
//#pragma comment(linker, "/STACK:102400000,102400000")
//C++
//int size = 256 << 20; // 256MB
//char *p = (char*)malloc(size) + size;
//__asm__("movl %0, %%esp\n" :: "r"(p));
//G++
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<ctime>
#include<deque>
#include<cmath>
#include<vector>
#include<string>
#include<cctype>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<sstream>
#include<iostream>
#include<algorithm>
#define REP(i,s,t) for(int i=(s);i<=(t);i++)
#define REP2(i,t,s) for(int i=(t);i>=s;i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned long ul;
const int N=105;
int n;
struct CountCutPoint
{
vector<int>G[N];
int low[N],pre[N];
bool iscut[N];
int dfs_clock;
void init()
{
REP(i,1,n)
{
G[i].clear();
}
memset(pre,0,sizeof(pre));
memset(iscut,false,sizeof(iscut));
dfs_clock=0;
}
void addedge(int u,int v)
{
G[u].push_back(v);
G[v].push_back(u);
}
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];
if(!pre[v])
{
child++;
int lowv=dfs(v,u);
lowu=min(lowu,lowv);
if(lowv>=pre[u])
{
iscut[u]=true;
}
}
else if(pre[v]<pre[u]&&v!=fa)
{
lowu=min(lowu,pre[v]);
}
}
if(fa<0&&child==1)
{
iscut[u]=0;
}
low[u]=lowu;
return lowu;
}
int solve()
{
dfs(1,-1);
int ans=0;
REP(i,1,n)
{
if(iscut[i])
{
ans++;
}
}
return ans;
}
void debug()
{
REP(i,1,n)
{
if(G[i].size()==0)
{
continue;
}
printf("%d ",i);
for(int j=0;j<G[i].size();j++)
{
printf(" %d",G[i][j]);
}
printf("\n");
}
REP(i,1,n)
{
printf("low[%d]=%d\n",i,low[i]);
}
printf("dfs_clock=%d\n",dfs_clock);
}
}solver;
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("test.in","r",stdin);
#endif
while(~scanf("%d",&n)&&n!=0)
{
solver.init();
int u;
while(~scanf("%d",&u)&&u!=0)
{
int v;
char c;
while(1)
{
scanf("%c",&c);
if(c=='\n')
{
break;
}
scanf("%d",&v);
solver.addedge(u,v);
}
}
printf("%d\n",solver.solve());
//solver.debug();
}
return 0;
}