CF1783F.Double Sort II
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given two permutations a and b , both of size n . A permutation of size n is an array of n elements, where each integer from 1 to n appears exactly once. The elements in each permutation are indexed from 1 to n .
You can perform the following operation any number of times:
- choose an integer i from 1 to n ;
- let x be the integer such that ax=i . Swap ai with ax ;
- let y be the integer such that by=i . Swap bi with by .
Your goal is to make both permutations sorted in ascending order (i. e. the conditions a1<a2<⋯<an and b1<b2<⋯<bn must be satisfied) using minimum number of operations. Note that both permutations must be sorted after you perform the sequence of operations you have chosen.
输入格式
The first line contains one integer n ( 2≤n≤3000 ).
The second line contains n integers a1,a2,…,an ( 1≤ai≤n ; all ai are distinct).
The third line contains n integers b1,b2,…,bn ( 1≤bi≤n ; all bi are distinct).
输出格式
First, print one integer k ( 0≤k≤2n ) — the minimum number of operations required to sort both permutations. Note that it can be shown that 2n operations are always enough.
Then, print k integers op1,op2,…,opk ( 1≤opj≤n ), where opj is the value of i you choose during the j -th operation.
If there are multiple answers, print any of them.
输入输出样例
输入#1
5 1 3 2 4 5 2 1 3 4 5
输出#1
1 2
输入#2
2 1 2 1 2
输出#2
0
输入#3
4 1 3 4 2 4 3 2 1
输出#3
2 3 4