Column Swapping Codeforces Solution | Codeforces Problem Solution 2022

Column Swapping Codeforces Solution | Codeforces Problem Solution 2022

C. Column Swapping

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a grid with 𝑛$n$ rows and 𝑚$m$ columns, where each cell has a positive integer written on it. Let's call a grid good, if in each row the sequence of numbers is sorted in a non-decreasing order. It means, that for each 1≤𝑖≤𝑛$1\le i\le n$ and 2≤𝑗≤𝑚$2\le j\le m$ the following holds: 𝑎𝑖,𝑗≥𝑎𝑖,𝑗−1$a_{i,j}\ge a_{i,j-1}$.

You have to to do the following operation exactly once: choose two columns with indexes 𝑖$i$ and 𝑗$j$ (not necessarily different), 1≤𝑖,𝑗≤𝑚$1\le i,j\le m$, and swap them.

Solution Click Below:-  CLICK HERE

You are asked to determine whether it is possible to make the grid good after the swap and, if it is, find the columns that need to be swapped.

Input

Each test contains multiple test cases. The first line contains the number of test cases 𝑡$t$ (1≤𝑡≤100$1\le t\le 100$).

Digit Minimization Codeforces Solution

Z mod X = C Codeforces Solution

Column Swapping Codeforces Solution

Traps Codeforces Solution

MEX vs DIFF Codeforces Solution

Diverse Segments Codeforces Solution

Euclid Guess Codeforces Solution

Hard Cut Codeforces Solution

 Description of the test cases follows.

The first line of each test case contains two integers 𝑛$n$ and 𝑚$m$ (1≤𝑛,𝑚≤2⋅105$1\le n,m\le 2\cdot {10}^5$) — the number of rows and columns respectively.

Each of the next 𝑛$n$ rows contains 𝑚$m$ integers, 𝑗$j$-th element of 𝑖$i$-th row is 𝑎𝑖,𝑗$a_{i,j}$ (1≤𝑎𝑖,𝑗≤109$1\le a_{i,j}\le {10}^9$) — the number written in the 𝑗$j$-th cell of the 𝑖$i$-th row.

It's guaranteed that the sum of 𝑛⋅𝑚$n\cdot m$ over all test cases does not exceed 2⋅105$2\cdot {10}^5$.

Output

If after the swap it is possible to get a good grid, output −1$-1$.

In the other case output 2$2$ integers — the indices of the columns that should be swapped to get a good grid.

If there are multiple solutions, print any.