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

原创 2015年11月20日 10:12:27

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;

}


版权声明:⁄(⁄ ⁄•⁄ω⁄•⁄ ⁄)⁄hiahiahia 欢迎斧正 举报

相关文章推荐

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

题意:给定n个点m条边。要求

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

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

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

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

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

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

Road Construction Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 9465 ...

POJ3177 Redundant Paths 3352的双胞胎题 双连通分量

虽然基本上和3352是一样的题意,但是要数据比较严格,这题有可能出现重边,而3352不会有重边。 思路: 直接在POJ3352,即上一篇博文上的代码稍微改动。 新建一个char matc...

POJ3177_Redundant_Paths_边双连通分量_tarjan

题意: 给一个图,问你最少添加多少条边可以成为一个双连通图(就是去掉任何一条边后图仍然连通) 题解:【摘自北大的集训课件】 只需在求出所有的桥以后,把桥边删除,原图变成了多个连通块,则每个连通块...

[POJ3177]Redundant Paths 边双连通分量 做题笔记

题目来源:http://poj.org/problem?id=3177 解题思路:http://www.cnblogs.com/frog112111/p/3367039.html 分析:在同一个...

poj 3177 Redundant Paths(双连通分量)

题意:给出一个无向图,要求添加最少的边令整个图双连通。 思路:求双连通分量,然后缩点,统计度数,最后直接算一下要连的边的个数……这种题也做过好几个了,感觉挺好做了 代码: #in...

poj 3177 Redundant Paths 边双连通分量

题意: 跟poj 3352

poj3177——Redundant Paths(双连通分量)

DescriptionIn order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1....
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)