Codeforces 699D

暑期集训3 J题

传送门：http://codeforces.com/problemset/problem/699/D

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 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

题意：给你一个序列，序列第i个值表示点i的父亲的序号

而给你的这个序列是不对的（可能有环或不连通）

先问你最少改变序列的几个值可以让这个序列变成一个真正的树，并输出任意一种改变方法

题解：把成环的个数统计一遍（根也算是成环）最后找其中一个父亲作为总根，把别的环作为它的儿子即可

讲道理说是这么说...真TM难写

并查集怎么判环到现在才会...

还有如何存这几个集合...

还是姿势水平不够

//补题补题补题 
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<map>
#include<set>
#include<vector>
using namespace std;

int father[200005];
int a[200005];
int ans[200005];

int findroot(int a)
{
	if(father[a]!=a) father[a]=findroot(father[a]); 
	return father[a];
}

void unionset(int a,int b)
{
	int fa=findroot(a);  
	int fb=findroot(b);  
	if(fa!=fb) father[a]=b;
}

int main()
{
	int n,i,sum,dsum,tfather;
	int fa,fb;
	
	sum=0;
	tfather=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		father[i]=i;
	for(i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		fa=findroot(i);
		fb=findroot(a[i]);
		if(fa==fb)
		{
			ans[sum]=i;
			sum++;
			if(a[i]==i) tfather=fa;
		}
		unionset(fa,fb);
	}
	if(tfather==0)
	{
		for(i=1;i<=n;i++)
		{
			fa=findroot(i);
			fb=findroot(a[i]);
			if(fa==fb) tfather=fa;
		}
	}
	dsum=0;
	for(i=0;i<sum;i++)
	{
		if(a[ans[i]]!=tfather)
		{
			dsum++;
			a[ans[i]]=tfather;
		}
	}
	printf("%d\n%d",dsum,a[1]);
	for(i=2;i<=n;i++)
		printf(" %d",a[i]);
	printf("\n");
	return 0;
}