链接:http://poj.org/problem?id=3352
和poj3177一样。
//the deeply same with poj3177
#include<cstdio>
#include<cstring>
#define MAXN 5005
#define MAXE 10005
using namespace std;
struct Edge
{
int to;
int next;
}edge[MAXE*2];
int map[MAXN][MAXN],head[MAXN],dfn[MAXN],low[MAXN],vist[MAXN],degree[MAXN];
int ecnt,index,n,r;
void add(int u,int v)
{
edge[ecnt].to=v;
edge[ecnt].next=head[u];
head[u]=ecnt++;
edge[ecnt].to=u;
edge[ecnt].next=head[v];
head[v]=ecnt++;
map[u][v]=map[v][u]=1;
}
void dfs(int u,int fa)
{
int i,v;
vist[u]=1;
low[u]=dfn[u]=++index;
for(i=head[u];i!=-1;i=edge[i].next)
{
v=edge[i].to;
if(v==fa)continue;
if(!vist[v])
dfs(v,u);
if(low[u]>low[v])
low[u]=low[v];
}
}
int tarjan()
{
int i,j,v,ans=0;
memset(dfn,0,sizeof(dfn));
memset(vist,0,sizeof(vist));
memset(degree,0,sizeof(degree));
index=0;
dfs(1,1);
for(i=1;i<=n;i++)
for(j=head[i];j!=-1;j=edge[j].next)
{
v=edge[j].to;
if(low[i]!=low[v])
degree[low[i]]++;
}
for(i=1;i<=n;i++)
if(degree[i]==1)
ans++;
return (ans+1)/2;
}
int main()
{
int i,a,b,res;
while(scanf("%d%d",&n,&r)!=EOF)
{
memset(head,-1,sizeof(head));
ecnt=0;
for(i=0;i<r;i++)
{
scanf("%d%d",&a,&b);
if(map[a][b])continue;
add(a,b);
}
res=tarjan();
printf("%d\n",res);
}
return 0;
}