Codeforces Round #363 (Div. 2)D. Fix a Tree并查集

题目链接

题目描述
D. Fix a Tree
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard 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:

There must be exactly one index r that pr = r. A vertex r is a root of the tree.
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 (because p4 = 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条边，改变其中一些边使得变成一棵树，完成读入后可以采用边判断边加入并查集的方法，若判断到结点i以及存储的前驱结点a[i]已经同属于一棵树(并查集里根节点相等)时，此时说明构成了环，那么此时需要将环断开，在结点i或a[i]处都可以，然后更新并查集继续做。

ac代码：

#include<iostream>
#include<cstdio>
using namespace std;
const int maxn=200000+5;
int a[maxn],pa[maxn];

int find(int x)
{
    return pa[x]==x? x:pa[x]=find(pa[x]);
}

void init(int n)
{
    for(int i=1;i<=n;i++)
    pa[i]=i;
}
int main()
{
    int n;
    scanf("%d",&n);
    init(n);
    int root=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        if(a[i]==i) root=i; //找到孤点，作为根节点
    }
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        if(i==root) continue;
        int px=find(i),py=find(a[i]);
        if(px==py)     //出现环
        {               //破环
            if(root==0)  //未找到孤点，选取环上一个点作为根结点
                root=i;
            a[i]=root;
            ans++;
        }
        else pa[px]=py;   //合并
    }
    printf("%d\n",ans);
    for(int i=1;i<=n;i++)
    printf("%d ",a[i]);
}