1365F - Swaps Again
问题描述
Ayush, Ashish and Vivek are busy preparing a new problem for the next Codeforces round and need help checking if their test cases are valid.
Each test case consists of an integer n and two arrays a and b, of size n. If after some (possibly zero) operations described below, array a can be transformed into array b, the input is said to be valid. Otherwise, it is invalid.
An operation on array a is:
select an integer k (1≤k≤⌊n2⌋)
swap the prefix of length k with the suffix of length k
For example, if array a initially is {1,2,3,4,5,6}, after performing an operation with k=2, it is transformed into {5,6,3,4,1,2}.
Given the set of test cases, help them determine if each one is valid or invalid.
Input
The first line contains one integer t (1≤t≤500) — the number of test cases. The description of each test case is as follows.
The first line of each test case contains a single integer n (1≤n≤500) — the size of the arrays.
The second line of each test case contains n integers a1, a2, …, an (1≤ai≤109) — elements of array a.
The third line of each test case contains n integers b1, b2, …, bn (1≤bi≤109) — elements of array b.
Output
For each test case, print “Yes” if the given input is valid. Otherwise print “No”.
实验法
思路分析
[1,2,3,4] [1,3,2,4]
[4,2,3,1] [4,3,2,1]
[3,4,1,2] [3,1,4,2]
[2,4,1,3] [2,1,4,3]
特征 1 和 4 配对，2和3 配对
判断 a中的(i,n-1-i)与b中的(j,n-1-j)能否匹配