CF1573B.Swaps
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given two arrays a and b of length n . Array a contains each odd integer from 1 to 2n in an arbitrary order, and array b contains each even integer from 1 to 2n in an arbitrary order.
You can perform the following operation on those arrays:
- choose one of the two arrays
- pick an index i from 1 to n−1
- swap the i -th and the (i+1) -th elements of the chosen array
Compute the minimum number of operations needed to make array a lexicographically smaller than array b .For two different arrays x and y of the same length n , we say that x is lexicographically smaller than y if in the first position where x and y differ, the array x has a smaller element than the corresponding element in y .
输入格式
Each test contains multiple test cases. The first line contains the number of test cases t ( 1≤t≤104 ).
The first line of each test case contains a single integer n ( 1≤n≤105 ) — the length of the arrays.
The second line of each test case contains n integers a1,a2,…,an ( 1≤ai≤2n , all ai are odd and pairwise distinct) — array a .
The third line of each test case contains n integers b1,b2,…,bn ( 1≤bi≤2n , all bi are even and pairwise distinct) — array b .
It is guaranteed that the sum of n over all test cases does not exceed 105 .
输出格式
For each test case, print one integer: the minimum number of operations needed to make array a lexicographically smaller than array b .
We can show that an answer always exists.
输入输出样例
输入#1
3 2 3 1 4 2 3 5 3 1 2 4 6 5 7 5 9 1 3 2 4 6 10 8
输出#1
0 2 3
说明/提示
In the first example, the array a is already lexicographically smaller than array b , so no operations are required.
In the second example, we can swap 5 and 3 and then swap 2 and 4 , which results in [3,5,1] and [4,2,6] . Another correct way is to swap 3 and 1 and then swap 5 and 1 , which results in [1,5,3] and [2,4,6] . Yet another correct way is to swap 4 and 6 and then swap 2 and 6 , which results in [5,3,1] and [6,2,4] .