Codeforces #363 (Div. 2) D. Fix a Tree
2016-07-29 20:35
246 查看
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:
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
output
input
output
input
output
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.
题意:给你一堆点阿,线阿,环阿,让你改最小的边(指向)变成树。
思路:有环拆环指向根节点,无环直接指向根节点。除非全是环否则根节点绝对不为环中的点(否则多变
一个点),用并查集查环,没有构成环添加,构成环变指向。
问题:夹克聚聚说他的dfs盖了139ms的时间戳,弱弱写的超时了...
代码:
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:
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.
题意:给你一堆点阿,线阿,环阿,让你改最小的边(指向)变成树。
思路:有环拆环指向根节点,无环直接指向根节点。除非全是环否则根节点绝对不为环中的点(否则多变
一个点),用并查集查环,没有构成环添加,构成环变指向。
问题:夹克聚聚说他的dfs盖了139ms的时间戳,弱弱写的超时了...
代码:
#include <iostream> #include <cstring> #include <string> #include <cstdio> #include <algorithm> using namespace std; int father[200000 + 5]; int a[200000 + 5]; bool vis[200000 + 5]; int root = -1 ,sum; int ffather(int x) { return father[x] == x?x:father[x]=ffather(father[x]); } void un(int x, int y) //合并:0-0-0-0 和 1-1-1-1,找到最边上的0,1,变成0-0-0-0==1-1-1-1 { x = ffather(x); y = ffather(y); if(x == y) return; else father[x] = y; } int main() { int n; cin>>n; for(int i = 1; i <= n; i++) cin>>a[i]; for(int i = 1; i <= n; i++) { father[i] = i; //初始化 } for(int i = 1; i <= n; i++) { if(a[i] == i) { root = a[i]; //找根节点 break; } } for(int i = 1; i <= n; i++) { if(ffather(a[i]) == ffather(i)) //若加入i和a[i]则成环 { if(root == -1) //给的数据全是环 { root = i; a[i] = i; sum++; } else if(a[i] != root) { a[i] = root; sum++; } } else un(i,a[i]); } for(int i = 1; i <= n; i++) { if(i == a[i] && i != root) { a[i] = root; sum++; } } cout<<sum<<endl<<a[1]; for(int i = 2; i <= n; i++) cout<<" "<<a[i]; }
相关文章推荐
- 将两个文件中的单词(汉字)交叉合并到一个文件中
- 百度——罪犯转移、裁剪网格纸、钓鱼比赛、蘑菇阵
- 邻接表与邻接矩阵的深度优先算法和广度优先算法
- 邻接表与邻接矩阵的深度优先算法和广度优先算法
- 常用正则表达式总结
- VC创建DLL动态链接库及其调用
- 双连通模板
- 事件的冒泡
- 事件
- JavaWEB中读取配置信息
- ecshop二次开发--视频上传
- iOS 常用Category类别分享
- c学习笔记(二)
- EditText末尾添加删除按钮
- Oracle 约束条件与数据表
- Codeforces268E Playlist(贪心)
- Vmware安装ubuntu编译android内核源码详细过程
- 最小费用最大流模板
- static const
- sdut oj2134 数据结构实验之栈四:括号匹配