zoukankan      html  css  js  c++  java
  • Codeforces Round #346 (Div. 2)---E. New Reform--- 并查集(或连通图)

    Codeforces Round #346 (Div. 2)---E. New Reform

    E. New Reform
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Berland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no more than one road. It is not guaranteed that you can get from any city to any other one, using only the existing roads.

    The President of Berland decided to make changes to the road system and instructed the Ministry of Transport to make this reform. Now, each road should be unidirectional (only lead from one city to another).

    In order not to cause great resentment among residents, the reform needs to be conducted so that there can be as few separate cities as possible. A city is considered separate, if no road leads into it, while it is allowed to have roads leading from this city.

    Help the Ministry of Transport to find the minimum possible number of separate cities after the reform.

    Input

    The first line of the input contains two positive integers, n and m — the number of the cities and the number of roads in Berland (2 ≤ n ≤ 100 000, 1 ≤ m ≤ 100 000).

    Next m lines contain the descriptions of the roads: the i-th road is determined by two distinct integers xi, yi (1 ≤ xi, yi ≤ nxi ≠ yi), where xi and yi are the numbers of the cities connected by the i-th road.

    It is guaranteed that there is no more than one road between each pair of cities, but it is not guaranteed that from any city you can get to any other one, using only roads.

    Output

    Print a single integer — the minimum number of separated cities after the reform.

    Examples
    input
    4 3
    2 1
    1 3
    4 3
    output
    1
    input
    5 5
    2 1
    1 3
    2 3
    2 5
    4 3
    output
    0
    input
    6 5
    1 2
    2 3
    4 5
    4 6
    5 6
    output
    1
    Note

    In the first sample the following road orientation is allowed: .

    The second sample: .

    The third sample: .

    代码如下:

    #include <iostream>
    #include <algorithm>
    #include <cstdio>
    #include <cstring>
    using namespace std;
    const int maxn=500000+1000;
    int par[maxn];
    bool cc[maxn];
    
    void init(int n)
    {
        for(int i=1;i<=n;i++)
            par[i]=i;
    }
    int find_(int x)
    {
        if(x==par[x])
            return x;
        else
            return par[x]=find_(par[x]);
    }
    int main()
    {
        int n,m;
        while(~scanf("%d%d",&n,&m))
        {
            init(n);
            memset(cc,0,sizeof(cc));
            for(int i=0;i<m;i++)
            {
                int u,v;
                scanf("%d%d",&u,&v);
                u=find_(u);
                v=find_(v);
                if(u==v)
                {
                   cc[u]=1;
                }
                else
                {
                    par[u]=v;
                    cc[v]=cc[u]||cc[v];
                }
            }
            int ans=0;
            for(int i=1;i<=n;i++)
            {
                if(par[i]==i&&!cc[i])
                ans++;
            }
            cout<<ans<<endl;
        }
        return 0;
    }
  • 相关阅读:
    nunit2.5.7 单元测试时提示:“当前不会命中断点 还没有为该文档加载任何符号”
    文件下载报错:引发类型为“System.OutOfMemoryException”的异常-.Net 内存溢出
    asp.net 访问页面访问统计实现 for iis7
    easyui tree 更改图标
    asp.net 访问页面访问统计实现
    记一次空格引起的查询问题
    SVN如何忽略dll文件和bin目录
    vmware 中安装Ghost XP 版本心得
    冒泡排序
    JS数组去重
  • 原文地址:https://www.cnblogs.com/chen9510/p/5571304.html
Copyright © 2011-2022 走看看