zoukankan      html  css  js  c++  java
  • cf #363 d

     
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    A tree is an undirected connected graph without cycles.

    Let's consider a rooted undirected tree with n vertices, numbered 1 through n. There are many ways to represent such a tree. One way is to create an array with n integers p1, p2, ..., pn, where pi denotes a parent of vertex i (here, for convenience a root is considered its own parent).

    For this rooted tree the array p is [2, 3, 3, 2].

    Given a sequence p1, p2, ..., pn, one is able to restore a tree:

    1. There must be exactly one index r that pr = r. A vertex r is a root of the tree.
    2. For all other n - 1 vertices i, there is an edge between vertex i and vertex pi.

    A sequence p1, p2, ..., pn is called valid if the described procedure generates some (any) rooted tree. For example, for n = 3 sequences(1,2,2), (2,3,1) and (2,1,3) are not valid.

    You are given a sequence a1, a2, ..., an, not necessarily valid. Your task is to change the minimum number of elements, in order to get a valid sequence. Print the minimum number of changes and an example of a valid sequence after that number of changes. If there are many valid sequences achievable in the minimum number of changes, print any of them.

    Input

    The first line of the input contains an integer n (2 ≤ n ≤ 200 000) — the number of vertices in the tree.

    The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ n).

    Output

    In the first line print the minimum number of elements to change, in order to get a valid sequence.

    In the second line, print any valid sequence possible to get from (a1, a2, ..., an) in the minimum number of changes. If there are many such sequences, any of them will be accepted.

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

    In the first sample, it's enough to change one element. In the provided output, a sequence represents a tree rooted in a vertex 4 (becausep4 = 4), which you can see on the left drawing below. One of other correct solutions would be a sequence 2 3 3 2, representing a tree rooted in vertex 3 (right drawing below). On both drawings, roots are painted red.

    破圈法
    #include<iostream>
    #include<stdio.h>
    #define maxx 200005
    using namespace std;
    int root=0;
    int ci=1;
    int ans=0;
    int a[maxx];
    int vis[maxx];
    void find(int x){
        vis[x]=ci;
        while(!vis[a[x]]){
            x=a[x];
            vis[x]=ci;
        }
        if(vis[a[x]]==ci){
            if(root==0){
                root=x;
            }
            if(a[x]!=root){
                a[x]=root;
                ans++;
            }
        }
        ci++;
    }
    int main(){
        int n;
        scanf("%d",&n);
        for(int i=0;i<=n;i++) vis[i]=0;
        for(int i=1;i<=n;i++){
          scanf("%d",&a[i]);
          if(i==a[i]) root=i;
    
        }
        for(int i=1;i<=n;i++){
            if(!vis[i]){
                find(i);
            }
        }
        printf("%d
    ",ans);
        for(int i=1;i<n;i++){
            printf("%d ",a[i]);
        }
        printf("%d
    ",a[n]);
        return 0;
    }
    View Code
  • 相关阅读:
    JQuery empty方法和remove方法的区别,使用remove清除之前的文本内容??
    乙_1023 组个最小数 (20分)
    乙_1022 D进制的A+B (20分)
    乙_1021 个位数统计 (15分)
    乙_1020 月饼 (25分)
    乙_1013 数素数 (20分)
    乙_1009 说反话 (20分)
    乙_1008 数组元素循环右移问题 (20分)
    乙_1007 素数对猜想 (20分)
    乙_1005 继续(3n+1)猜想 (25分)
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5690629.html
Copyright © 2011-2022 走看看