[Solution] Equal Reversal Codeforces Solution

[Solution] Equal Reversal Codeforces Solution | Codeforces Problem Solution 2022

F. Equal Reversal

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There is an array a$a$ of length n$n$. You may perform the following operation on it:

• Choose two indices l$l$ and r$r$ where 1≤l≤r≤n$1\le l\le r\le n$ and al=ar$a_l=a_r$. Then, reverse the subsegment from the l$l$-th to the r$r$-th element, i. e. set [al,al+1,…,ar−1,ar]$[a_l,a_{l+1},\dots ,a_{r-1},a_r]$ to [ar,ar−1,…,al+1,al]$[a_r,a_{r-1},\dots ,a_{l+1},a_l]$.

You are also given another array b$b$ of length n$n$ which is a permutation of a$a$. Find a sequence of at most n2$n^2$ operations that transforms array a$a$ into b$b$, or report that no such sequence exists.

Input

Each test contains multiple test cases. The first line contains a single integer t$t$ (1≤t≤100$1\le t\le 100$) — the number of test cases. The description of the test cases follows.

The first line of each test case contains an integer n$n$ (1≤n≤500$1\le n\le 500$) — the length of array a$a$ and b$b$.

The second line of each test case contains n$n$ integers a1,a2,…,an$a_1,a_2,\dots ,a_n$ (1≤ai≤n$1\le a_i\le n$) — elements of the array a$a$.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

The third line of each test case contains n$n$ integers b1,b2,…,bn$b_1,b_2,\dots ,b_n$ (1≤bi≤n$1\le b_i\le n$) — elements of the array b$b$.

It is guaranteed that b$b$ is a permutation of a$a$.

It is guaranteed that the sum of n$n$ over all test cases does not exceed 500$500$.

Output

For each test case, output "NO" (without quotes) if it is impossible to turn a$a$ into b$b$ using at

XOR Mixup Codeforces Solution

Equal Reversal Codeforces Solution

Rising Sand Codeforces Solution

3SUM Closure Codeforces Solution

Fixed Point Guessing Codeforces Solution

PermutationForces II Codeforces Solution

Long Binary String Codeforces Solution

 most n2$n^2$ operations.

Otherwise, output "YES" (without quotes). Then output an integer k$k$ (0≤k≤n2$0\le k\le n^2$) denoting the number of operations you will perform. Note that you don't have to minimize the number of operations.

Afterwards, output k$k$ lines. The i$i$-th line should contain two integers li$l_i$ and ri$r_i$ (1≤li≤ri≤n$1\le l_i\le r_i\le n$) — the left and right indices for the i$i$-th operation.

You can output "YES" and "NO" in any case (for example, strings "yEs", "yes" and "Yes" will be recognized as a positive response).

If there are multiple possible sequences of operations, you may output any of them.