zoukankan      html  css  js  c++  java
  • codeforces 755C. PolandBall and Forest

    C. PolandBall and Forest
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    PolandBall lives in a forest with his family. There are some trees in the forest. Trees are undirected acyclic graphs with k vertices andk - 1 edges, where k is some integer. Note that one vertex is a valid tree.

    There is exactly one relative living in each vertex of each tree, they have unique ids from 1 to n. For each Ball i we know the id of its most distant relative living on the same tree. If there are several such vertices, we only know the value of the one with smallest id among those.

    How many trees are there in the forest?

    Input

    The first line contains single integer n (1 ≤ n ≤ 104) — the number of Balls living in the forest.

    The second line contains a sequence p1, p2, ..., pn of length n, where (1 ≤ pi ≤ n) holds and pi denotes the most distant from Ball irelative living on the same tree. If there are several most distant relatives living on the same tree, pi is the id of one with the smallest id.

    It's guaranteed that the sequence p corresponds to some valid forest.

    Hacking: To hack someone, you should provide a correct forest as a test. The sequence p will be calculated according to the forest and given to the solution you try to hack as input. Use the following format:

    In the first line, output the integer n (1 ≤ n ≤ 104) — the number of Balls and the integer m (0 ≤ m < n) — the total number of edges in the forest. Then m lines should follow. The i-th of them should contain two integers ai and bi and represent an edge between vertices in which relatives ai and bi live. For example, the first sample is written as follows:


    5 3
    1 2
    3 4
    4 5
    Output

    You should output the number of trees in the forest where PolandBall lives.

    Interaction

    From the technical side, this problem is interactive. However, it should not affect you (except hacking) since there is no interaction.

    Examples
    input
    5
    2 1 5 3 3
    output
    2
    input
    1
    1
    output
    1
    Note

    In the first sample testcase, possible forest is: 1-2 3-4-5.

    There are 2 trees overall.

    In the second sample testcase, the only possible graph is one vertex and no edges. Therefore, there is only one tree.


    告诉你这是一个由森林构成的图,每个边权为1,每个点的与它最远的点的标号已给出,求最少要多少颗树。


    直接并查集就结束了,还纠结了好久。。。。
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<algorithm>
     4 #include<vector>
     5 #include<cstdlib>
     6 #include<cmath>
     7 #include<cstring>
     8 using namespace std;
     9 #define maxn 100010
    10 #define llg long long 
    11 #define yyj(a) freopen(a".in","r",stdin),freopen(a".out","w",stdout);
    12 llg n,m,fa[maxn],bj[maxn],x,f1,f2,ans;
    13 
    14 llg find(llg x){if (fa[x]!=x) fa[x]=find(fa[x]); return fa[x];}
    15 
    16 int main()
    17 {
    18     yyj("C");
    19     cin>>n;
    20     for (llg i=1;i<=n;i++) fa[i]=i;
    21     for (llg i=1;i<=n;i++)
    22     {
    23         scanf("%lld",&x);
    24         f1=find(i); f2=find(x);
    25         if (f1!=f2) fa[f2]=f1;
    26     }
    27     for (llg i=1;i<=n;i++) if (!bj[find(i)]) ans++,bj[find(i)]=1;
    28     cout<<ans;
    29     return 0;
    30 }
    本文作者:xrdog 作者博客:http://www.cnblogs.com/Dragon-Light/ 转载请注明出处,侵权必究,保留最终解释权!
  • 相关阅读:
    python3安装 MAC
    MacOS三个比较接地气实用的终端命令
    maya界面字体怎么设置大小?
    Mac 下 Android Studio 连 夜神模拟器 调试以及真机调试方法
    [macOS] Mojave10.14 夜神安卓模拟器启动问题
    解决MAC电脑系统设置的安全性与隐私下通用没有任何来源选项
    一个分析“文件夹”选择框实现方法的过程
    windows下nginx+php简单配置
    使用windbg抓取崩溃文件和分析的过程
    解决工作中遇到的一个"打开,保存"文件框的bug的过程
  • 原文地址:https://www.cnblogs.com/Dragon-Light/p/6288359.html
Copyright © 2011-2022 走看看