标签：
| Time Limit: 2000MS | Memory Limit: 65536K | |
| Total Submissions: 9353 | Accepted: 4648 |
Description
It‘s almost summer time, and that means that it‘s almost summer construction time! This year, the good people who are in charge of the roads on the tropical island paradise of Remote Island would like to repair and upgrade the various roads that lead between the various tourist attractions on the island.
The roads themselves are also rather interesting. Due to the strange customs of the island, the roads are arranged so that they never meet at intersections, but rather pass over or under each other using bridges and tunnels. In this way, each road runs between two specific tourist attractions, so that the tourists do not become irreparably lost.
Unfortunately, given the nature of the repairs and upgrades needed on each road, when the construction company works on a particular road, it is unusable in either direction. This could cause a problem if it becomes impossible to travel between two tourist attractions, even if the construction company works on only one road at any particular time.
So, the Road Department of Remote Island has decided to call upon your consulting services to help remedy this problem. It has been decided that new roads will have to be built between the various attractions in such a way that in the final configuration, if any one road is undergoing construction, it would still be possible to travel between any two tourist attractions using the remaining roads. Your task is to find the minimum number of new roads necessary.
Input
The first line of input will consist of positive integers n and r, separated by a space, where 3 ≤ n ≤ 1000 is the number of tourist attractions on the island, and 2 ≤ r ≤ 1000 is the number of roads. The tourist attractions are conveniently labelled from 1 to n. Each of the following r lines will consist of two integers, v and w, separated by a space, indicating that a road exists between the attractions labelled v and w. Note that you may travel in either direction down each road, and any pair of tourist attractions will have at most one road directly between them. Also, you are assured that in the current configuration, it is possible to travel between any two tourist attractions.
Output
One line, consisting of an integer, which gives the minimum number of roads that we need to add.
Sample Input
Sample Input 1 10 12 1 2 1 3 1 4 2 5 2 6 5 6 3 7 3 8 7 8 4 9 4 10 9 10 Sample Input 2 3 3 1 2 2 3 1 3
Sample Output
Output for Sample Input 1 2 Output for Sample Input 2 0
Source
题目大意：求加多少条边变成双联通
ac代码
#include<stdio.h>
#include<string.h>
#define max(a,b) (a>b?a:b)
#define min(a,b) (a>b?b:a)
int belong[1100],low[1100],dfn[1100],ins[1100],stack[1100],head[1100],dig[1100*2];
int cnt,top,time,taj,n,m;
struct s
{
int u,v,next;
}edge[1100*2];
void init()
{
memset(head,-1,sizeof(head));
memset(stack,0,sizeof(stack));
memset(ins,0,sizeof(ins));
memset(dfn,-1,sizeof(dfn));
memset(low,-1,sizeof(low));
memset(belong,-1,sizeof(belong));
memset(dig,0,sizeof(dig));
cnt=top=time=taj=0;
}
void add(int u,int v)
{
edge[cnt].u=u;
edge[cnt].v=v;
edge[cnt].next=head[u];
head[u]=cnt++;
}
void tarjan(int u,int pre)
{
low[u]=dfn[u]=time++;
stack[top++]=u;
ins[u]=1;
int flag=1;
for(int i=head[u];i!=-1;i=edge[i].next)
{
int v=edge[i].v;
if(flag&&v==pre)
{
flag=0;
continue;
}
if(dfn[v]==-1)
{
tarjan(v,u);
low[u]=min(low[u],low[v]);
}
else
if(ins[v])
low[u]=min(dfn[v],low[u]);
}
if(low[u]==dfn[u])
{
taj++;
int now;
do
{
now=stack[--top];
ins[now]=0;
belong[now]=taj;
}while(now!=u);
}
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
int i,j;
init();
for(i=0;i<m;i++)
{
int a,b;
scanf("%d%d",&a,&b);
add(a,b);
add(b,a);
}
for(i=1;i<=n;i++)
{
if(dfn[i]==-1)
{
tarjan(i,-1);
}
}
for(i=0;i<cnt;i++)
{
int v=edge[i].v;
int u=edge[i].u;
if(belong[u]!=belong[v])
{
dig[belong[u]]++;
//dig[belong[v]]++;
}
}
// for(i=1;i<=n;i++)
// printf("%d %d\n",i,belong[i]);
int ans=0;
for(i=1;i<=taj;i++)
{
// printf("%d\n",dig[i]);
if(dig[i]==1)
ans++;
}
printf("%d\n",(ans+1)/2);
}
}标签：
原文地址：http://blog.csdn.net/yu_ch_sh/article/details/44261611
