Codeforces 699D. Fix a Tree【并查集+思维】

D. Fix a Tree

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 p₁, p₂, ..., p_n, where p_i 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 p₁, p₂, ..., p_n, one is able to restore a tree:

1. There must be exactly one index r that p_r = 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 p_i.

A sequence p₁, p₂, ..., p_n 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 a₁, a₂, ..., a_n, 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 a₁, a₂, ..., a_n (1 ≤ a_i ≤ 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 (a₁, a₂, ..., a_n) 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 (because p₄ = 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.

In the second sample, the given sequence is already valid.

题目大意：

给你N个点，给你N个信息a1，a2...........an.a1表示节点1和节点a1之间有一条树边（节点a1是节点1的父节点），a2表示节点2和节点a2之间有一条树边（节点a2是节点2的父节点）。问你最少改变多少个ai，使得最终图是一棵树。

思路：

1、问题不难，其实就是在处理孤立点和环边、我们使用并查集来搞定这个问题。

2、对应我们扫一遍数组的同时（无非就只有两种情况）：

①如果a【i】==i，那么说明这个点可能是孤立点，那么我们设定ans【i】=-1.

②如果我们a【i】！=i，那么进行merge操作。如果能够合并两个节点，那么说明这两个节点之间不存在环，否则如果合并不了，那么说明这条边就是一个环边，那么对应将ans【i】=-2.

如果不满足以上两条，那么ans【i】=ai.，即答案不需要改动。

3、对于ans【i】=-1的点i，其有可能是孤立点，也有可能是一棵树的根节点，无论其是哪一种，我们都可以将其设定为最终树的根节点，那么我们一层for扫一遍ans【】，来找寻这样一个点，如果找到了，那么我们设定这个点是最终树的根节点，并且ans【i】=i，接下来对应我们将剩余的ans【i】<0的部分都连入这个点即可。过程维护操作数。

如果我们没有找到ans【i】=-1的点，那么我们接下来来找ans【i】=-2的点，这个点连出的边是环边，其也可以作为最终树的根节点，只不过与上述操作不同的是，这种点需要进行一次改动，接下来的操作相同，过程维护操作数即可。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
int f[200600];
int a[200600];
int ans[200600];
int find(int a)
{
    int r=a;
    while(f[r]!=r)
    r=f[r];
    int i=a;
    int j;
    while(i!=r)
    {
        j=f[i];
        f[i]=r;
        i=j;
    }
    return r;
}
int merge(int a,int b)
{
    int A,B;
    A=find(a);
    B=find(b);
    if(A!=B)
    {
        f[B]=A;
        return 1;
    }
    else return 0;
}
int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=1;i<=n;i++)f[i]=i;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        for(int i=1;i<=n;i++)
        {
            if(i==a[i])
            {
                ans[i]=-1;
                continue;
            }
            if(merge(i,a[i])==1)
            {
                ans[i]=a[i];
            }
            else
            {
                ans[i]=-2;
            }
        }
        int root=-1;
        for(int i=1;i<=n;i++)
        {
            if(ans[i]==-1)
            {
                ans[i]=i;
                root=i;
                break;
            }
        }
        int cnt=0;
        if(root==-1)
        {
            for(int i=1;i<=n;i++)
            {
                if(ans[i]==-2)
                {
                    cnt++;
                    ans[i]=i;
                    root=i;
                    break;
                }
            }
        }
        for(int i=1;i<=n;i++)
        {
            if(i==root)continue;
            else
            {
                if(ans[i]<0)
                ans[i]=root,cnt++;
            }
        }
        printf("%d\n",cnt);
        for(int i=1;i<=n;i++)
        {
            printf("%d ",ans[i]);
        }
        printf("\n");
    }
}