Different Subarrays Rearrange CodeChef Solution | CodeChef Problem Solution 2022

Different Subarrays Rearrange CodeChef Solution | CodeChef Problem Solution 2022

You are given an array A$A$ of N$N$ integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$. Determine if there are two permutations B$B$ and C$C$ of this array, for which the following condition is satisfied:

• There doesn't exist a pair of integers (i,j)$(i,j)$ such that 1≤i≤j≤N$1\le i\le j\le N$ and (i,j)≠(1,N)$(i,j)\ne (1,N)$, for which the subarray B[i:j]$B[i:j]$ is a permutation of subarray C[i:j]$C[i:j]$.

If there exist such permutations, find any of them.

Solution Click Below:-  CLICK HERE

As a reminder, B[i:j]$B[i:j]$ refers to the subarray [Bi,Bi+1,…,Bj]$[B_i,B_{i+1},\dots ,B_j]$

Input Format

• The first line of the input contains a single integer T$T$, the number of test cases. The description of the test cases follows.

Number Transformation Codeforces Solution

Remove Directed Edges Codeforces Solution

Desktop Rearrangement Codeforces Solution

Dictionary Codeforces Solution

Breaking the Wall Codeforces Solution

A-B-C Sort Codeforces Solution

Infinite Replacement Codeforces Solution 

• The first line of each test case contains a single integer N$N$ — the number of integers.
• The second line of each test case contains N$N$ space-separated integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$.

Output Format

For each test case, if there are no such permutations B$B$ and C$C$, output NO.

Otherwise, on the first line output YES. In the next line, output N$N$ integers B1,B2,…,BN$B_1,B_2,\dots ,B_N$. In the next line, output N$N$ integers C1,C2,…,CN$C_1,C_2,\dots ,C_N$.

You may print each character of YES/NO in either uppercase or lowercase (for example, the strings YES, yeS, YeS, and yEs will all be treated as identical).

Constraints

• 1≤T≤100$1\le T\le 100$
• 3≤N≤1000$3\le N\le 1000$
• 0≤Ai≤109$0\le A_i\le {10}^9$
• The sum of N$N$ over all test cases doesn't exceed 2000$2000$.

Sample Input 1 

3
3
1 1 2
4
19 39 19 84
6
1 2 3 1 2 3

Sample Output 1 

NO
YES
19 19 39 84 
39 84 19 19 
YES
1 1 2 2 3 3 
2 3 3 1 1 2 

Join Now for Solution:-