Some ES242 students are are busy preparing a new problem for the next D'Code round and...

Transcribed Image Text:

Some ES242 students are are busy preparing a new problem for the next D'Code 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 (1sks|n/2]) • 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 (1sts500) – 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 (1sns500) – the size of the arrays. The second line of each test case contains n integers a1, a2, ., an (1sais109) – elements of array a. The third line of each test case contains n integers b1, b2, . bn (1sbis10) – elements of array b. Output For each test case, print "Yes" if the given input is valid. Otherwise print "No". Example input 2 1 2 2 1 1 2 3 1 2 3 1 2 4 1 3 4 1 2 3 2 3 122 1 2 3 13 2 4. output Yes Yes No Yes No Note: For the first test case, we can swap prefix a[1:1] with suffix a[2:2] to get a=[2,1]. For the second test case, a is already equal to b. For the third test case, it is impossible since we cannot obtain 3 in a. For the fourth test case, we can first swap prefix a[1:1] with suffix a[4:4] to obtain a=[2,2,3,1]. Now we can swap prefix a[1:2] with suffix a[3:4] to obtain a=[3,1,2,2]. For the fifth test case, it is impossible to convert a to b. Some ES242 students are are busy preparing a new problem for the next D'Code 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 (1sks|n/2]) • 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 (1sts500) – 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 (1sns500) – the size of the arrays. The second line of each test case contains n integers a1, a2, ., an (1sais109) – elements of array a. The third line of each test case contains n integers b1, b2, . bn (1sbis10) – elements of array b. Output For each test case, print "Yes" if the given input is valid. Otherwise print "No". Example input 2 1 2 2 1 1 2 3 1 2 3 1 2 4 1 3 4 1 2 3 2 3 122 1 2 3 13 2 4. output Yes Yes No Yes No Note: For the first test case, we can swap prefix a[1:1] with suffix a[2:2] to get a=[2,1]. For the second test case, a is already equal to b. For the third test case, it is impossible since we cannot obtain 3 in a. For the fourth test case, we can first swap prefix a[1:1] with suffix a[4:4] to obtain a=[2,2,3,1]. Now we can swap prefix a[1:2] with suffix a[3:4] to obtain a=[3,1,2,2]. For the fifth test case, it is impossible to convert a to b.

Answer rating: 100% (QA)

The Code of this problem is as follow include include include in... View the full answer