【Tarjan缩点】PO3352 Road Construction
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 12532 | Accepted: 6309 |
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
题意
就是说求最少加多少边能使一个无向图去任意一条边后仍然联通……
题解
刷水题有益身心健康~
就是一个简单的Tarjan缩点求最后只连一条边的点的个数
记得要(ans+1)/2~
代码
//by 减维 #include<cstdio> #include<iostream> #include<cstring> #include<queue> #include<cstdlib> #include<ctime> #include<cmath> #include<algorithm> #define ll long long #define maxn using namespace std; struct edge{ int fr,to,ne; }e[5010]; int n,m,ecnt,cnt,ans,tot,num,dfn[5010],low[5010],map[5010]; int head[5010],zhan[5010],bian[5010]; bool pd[5010]; void tarjan(int x,int fa) { dfn[x]=low[x]=++num; zhan[++tot]=x; pd[x]=1; //for(int i=1;i<=n;++i)printf("%d ",dfn[i]);printf("\n"); //for(int i=1;i<=n;++i)printf("%d ",low[i]);printf("\n"); //for(int i=1;i<=n;++i)printf("%d ",map[i]);printf("\n"); for(int i=head[x];i;i=e[i].ne) { int dd=e[i].to; //printf("%d\n",dd); if(dd==fa)continue; if(!dfn[dd]){ tarjan(dd,x); low[x]=min(low[x],low[dd]); }else if(pd[dd]){ low[x]=min(dfn[dd],low[x]); } } if(dfn[x]==low[x]){ cnt++; int t; do{ t=zhan[tot--]; map[t]=cnt; pd[t]=0; }while(t!=x); } } void add(int x,int y) { e[++ecnt].to=y; e[ecnt].fr=x; e[ecnt].ne=head[x]; head[x]=ecnt; } int main() { scanf("%d%d",&n,&m); for(int i=1;i<=m;++i) { int x,y; scanf("%d%d",&x,&y); add(x,y); add(y,x); } for(int i=1;i<=n;++i)if(!dfn[i])tarjan(i,0); //for(int i=1;i<=n;++i)printf("%d ",dfn[i]);printf("\n"); //for(int i=1;i<=n;++i)printf("%d ",low[i]);printf("\n"); //for(int i=1;i<=n;++i)printf("%d ",map[i]);printf("\n"); for(int i=1;i<=ecnt;i+=2) { int x=e[i].fr,y=e[i].to; if(map[x]!=map[y])bian[map[x]]++,bian[map[y]]++; } memset(pd,0,sizeof(pd)); ans=0; for(int i=1;i<=n;++i) if(!pd[map[i]]&&bian[map[i]]==1)ans++,pd[map[i]]=1; //else if(!pd[map[i]]&&bian[map[i]]==0)ans+=2,pd[map[i]]=1; printf("%d",(ans+1)/2); }
- POJ 3352--Road Construction【无向图增加最少的边成为边双连通图 && tarjan求ebc && 缩点构造缩点树】
- POJ 3177&&3352题解 tarjan算割边 求双连通分量 缩点
- POJ 3352 Road Construction POJ 3177 Redundant Paths(边双连通图 Tarjan+缩点)
- POJ-3352 Road Construction,tarjan缩点求边双连通!
- POJ 3352 Road Construction (边双连通分量 Tarjan缩点)
- POJ 3352 Road Construction POJ 3177Redundant Paths(Tarjan缩点)
- [POJ1236]Network of Schools(Tarjan缩点+强连通分量)
- hrbust 1797 Fly【Tarjan强连通+缩点染色+最长路SPFA】好题~
- POJ 3710 Christmas Game 无向图删边 经典的删边游戏 Tarjan缩点
- hihocoder 1185(tarjan缩点)
- [HDU3861]The King's Problem(Tarjan缩点+二分图匹配)
- BZOJ 1179: [Apio2009]Atm(tarjan缩点+spfa)
- hdu5934(tarjan缩点)
- Tarjan缩点模板
- bzoj1179 [Apio2009]Atm(tarjan缩点+spfa)
- Tarjan缩点+SPFA——正则表达式
- 洛谷 P2194 HXY烧情侣【Tarjan缩点】 分析+题解代码
- BZOJ1093 [ZJOI2007]最大半连通子图 【tarjan缩点 + DAG最长路计数】
- BZOJ1565 [NOI2009]植物大战僵尸 【最大权闭合子图 + tarjan缩点(或拓扑)】
- POJ 1236 Tarjan缩点+求度数