关闭

poj3177Redundant Paths【构造双连通分量:并查集缩点 模板】

标签: tarjanpoj并查集双连通分量
585人阅读 评论(0) 收藏 举报
分类:

Description

In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten Apples. The cows are now tired of often being forced to take a particular path and want to build some new paths so that they will always have a choice of at least two separate routes between any pair of fields. They currently have at least one route between each pair of fields and want to have at least two. Of course, they can only travel on Official Paths when they move from one field to another. 

Given a description of the current set of R (F-1 <= R <= 10,000) paths that each connect exactly two different fields, determine the minimum number of new paths (each of which connects exactly two fields) that must be built so that there are at least two separate routes between any pair of fields. Routes are considered separate if they use none of the same paths, even if they visit the same intermediate field along the way. 

There might already be more than one paths between the same pair of fields, and you may also build a new path that connects the same fields as some other path.

Input

Line 1: Two space-separated integers: F and R 

Lines 2..R+1: Each line contains two space-separated integers which are the fields at the endpoints of some path.

Output

Line 1: A single integer that is the number of new paths that must be built.

Sample Input

7 7
1 2
2 3
3 4
2 5
4 5
5 6
5 7

Sample Output

2

这个题就是问加几条边可以构成双连通分量,一开始图样图森破的以为只是求桥的个数就好,然而并非如此……

构造双连通分量的加边数=(原图的叶节点数+1)/2    因为双连通分量需要成环嘛,原图已经是连着的了,所以只需要在另一侧再加一条边就成环啦~怎么判断哪里是叶结点呢?先用并查集缩点,把所有当前的双连通分量都缩到一起,然后就构成了只有桥的图,枚举每个桥,记录每个点的次数,每次加一。只有1的点就是原图的叶结点~。~

而且并查集不就是干这个用的么╮(╯_╰)╭

/***************
poj3177
2015.11.20
***************/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <stack>

using namespace std;

const int N=5006;
vector<int>G[N];
struct bridge
{
    int u,v;
}bg[2*N];
int vis[N],low[N],dfn[N],Time;
int fa[N],deg[N];
int n,m,cnt;
void init()
{
    for(int i=0;i<n;i++) G[i].clear();
    memset(dfn,0,sizeof(dfn));
    memset(low,0,sizeof(low));
    memset(vis,0,sizeof(vis));
    memset(deg,0,sizeof(deg));
    for(int i=1;i<=n;i++) fa[i]=i;
    cnt=Time=0;
}
int findset(int x)
{
    if(x!=fa[x])
        fa[x]=findset(fa[x]);
    return fa[x];
}
void Tarjan(int u,int father)
{
    low[u] = dfn[u] = ++Time;
    vis[u] = 1;
    for(int i=0;i<G[u].size();i++)
    {
        int v = G[u][i];
        if(v == father)
            continue;
        if(!vis[v])
        {
            Tarjan(v,u);
            low[u] = min(low[u],low[v]);
            if(low[v] > dfn[u])        //u->v为桥
                bg[cnt].u = u,bg[cnt++].v = v;
            else   //否则,u,v同属一个连通分量,合并
            {
                int fx = findset(u);
                int fy = findset(v);
                if(fx != fy)
                    fa[fx] = fy;
            }
        }
        else
            low[u] = min(low[u],dfn[v]);
    }
}

int main()
{
   // freopen("cin.txt","r",stdin);
    while(~scanf("%d%d", &n, &m))
    {
        init();
        for(int i=0;i<m;i++)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            G[u].push_back(v);
            G[v].push_back(u);
        }
        Tarjan(1,-1);
        for(int i=0;i<cnt;i++)
        {
            int fx=findset(bg[i].u);
            int fy=findset(bg[i].v);
            deg[fx]++;
            deg[fy]++;
        }
        int leaf=0;
        for(int i=1;i<=n;i++)
            if(deg[i]==1)
                leaf++;
        printf("%d\n",(leaf+1)/2);
    }
    return 0;

}


0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

poj3352 Road Construction(边双连通分量)

题意:给你一个连通的无向图,现在问你最少在该图中添加几条边,能使得该图变成边双连通图? 思路:          思路主要参照这两个博客          http://blog.csdn.ne...
  • qq_21057881
  • qq_21057881
  • 2016-02-04 12:35
  • 311

【连通图|边双连通+缩点】POJ-3177 Redundant Paths

给出一个无向图,保证是连通的,问要把这个无向图变成边双连通图需要至少修建几条新路。
  • u012325552
  • u012325552
  • 2014-12-28 10:09
  • 1213

Tarjan三大算法之双连通分量(割点,桥)

Robert Endre Tarjan是一个美国计算机学家,他传奇的一生中发明了无数算法,统称为Tarjan算法。其中最著名的有三个,分别用来求解 1) 无向图的双连通分量 2) 有向图的强连通分...
  • fuyukai
  • fuyukai
  • 2016-04-23 11:25
  • 4921

Tarjan三大算法之双连通分量(双连通分量)

定义: 对于一个连通图,如果任意两点至少存在两条点不重复路径,则称这个图为点双连通的(简称双连通);如果任意两点至少存在两条边不重复路径,则称该图为边双连通的。点双连通图的定义等价于任意两条边都同在...
  • fuyukai
  • fuyukai
  • 2016-05-03 16:18
  • 9103

poj 3177 Redundant Paths 边双连通分量+缩点

题意:给定n个点m条边。要求
  • CHCXCHC
  • CHCXCHC
  • 2014-07-11 14:27
  • 647

POJ 3177 Redundant Paths(边双连通分量+缩点)

POJ 3177 Redundant Paths(边双连通分量+缩点) http://poj.org/problem?id=3177 题意:给你一个无向连通图,问你至少需要添加几条边能使得该图是一...
  • u013480600
  • u013480600
  • 2014-06-17 11:02
  • 806

Poj 3352 Road Construction & Poj 3177 Redundant Paths(边双连通分量+缩点)

Road Construction Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 9465 ...
  • LYHVOYAGE
  • LYHVOYAGE
  • 2015-04-23 16:38
  • 946

POJ 3177 / POJ 3352 : Redundant Paths / Road Construction - 边双连通分量,缩点

题意:给定现有的R条直接连接2个牧场的路,F-1分析:见代码及注释……《图论算法理论实现应用》——P4123177Accepted700K16MSG++2320B2014-03-14 16:55:30...
  • Booky_Amnesia
  • Booky_Amnesia
  • 2015-01-10 21:46
  • 339

poj 3177 Redundant Paths(边双连通分量+缩点)★

题意:有n个牧场,Bessie 要从一个牧场到另一个牧场,要求至少要有2条独立的路可以走。现已有m条路,求至少要新建多少条路,使得任何两个牧场之间至少有两条独立的路。两条独立的路是指:没有公共边的路,...
  • Ezereal
  • Ezereal
  • 2016-09-13 23:18
  • 889

POJ 3177 Redundant Paths 边的双连通分量

转自韦广:http://blog.csdn.net/weiguang_123/article/details/7538184 题目大意:每头牛希望在任意两个点u和v之间,从u到v有两条完全不同的路径...
  • sdj222555
  • sdj222555
  • 2012-01-19 18:01
  • 1769
    碎碎念
    周小姐,你还想毕业找不到工作吗????
    个人资料
    • 访问:263646次
    • 积分:8609
    • 等级:
    • 排名:第2641名
    • 原创:606篇
    • 转载:25篇
    • 译文:0篇
    • 评论:38条
    友情链接