codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1243B2.md (2343B)


      1 Source: https://codeforces.com/problemset/problem/1243/B2
      2 
      3 B2. Character Swap (Hard Version)
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 This problem is different from the easy version. In this version Ujan makes at most $2n$ swaps. In addition, $k \le 1000, n \le 50$ and it is necessary to print swaps themselves. You can hack this problem if you solve it. But you can hack the previous problem only if you solve both problems.
     22 
     23 After struggling and failing many times, Ujan decided to try to clean up his house again. He decided to get his strings in order first.
     24 
     25 Ujan has two distinct strings $s$ and $t$ of length $n$ consisting of only of lowercase English characters. He wants to make them equal. Since Ujan is lazy, he will perform the following operation at most $2n$ times: he takes two positions $i$ and $j$ ($1 \le i,j \le n$, the values $i$ and $j$ can be equal or different), and swaps the characters $s_i$ and $t_j$.
     26 
     27 Ujan's goal is to make the strings $s$ and $t$ equal. He does not need to minimize the number of performed operations: any sequence of operations of length $2n$ or shorter is suitable.
     28 
     29 Input
     30 
     31 The first line contains a single integer $k$ ($1 \leq k \leq 1000$), the number of test cases.
     32 
     33 For each of the test cases, the first line contains a single integer $n$ ($2 \leq n \leq 50$), the length of the strings $s$ and $t$.
     34 
     35 Each of the next two lines contains the strings $s$ and $t$, each having length exactly $n$. The strings consist only of lowercase English letters. It is guaranteed that strings are different.
     36 
     37 Output
     38 
     39 For each test case, output "Yes" if Ujan can make the two strings equal with at most $2n$ operations and "No" otherwise. You can print each letter in any case (upper or lower).
     40 
     41 In the case of "Yes" print $m$ ($1 \le m \le 2n$) on the next line, where $m$ is the number of swap operations to make the strings equal. Then print $m$ lines, each line should contain two integers $i, j$ ($1 \le i, j \le n$) meaning that Ujan swaps $s_i$ and $t_j$ during the corresponding operation. You do not need to minimize the number of operations. Any sequence of length not more than $2n$ is suitable.
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 4
     49 5
     50 souse
     51 houhe
     52 3
     53 cat
     54 dog
     55 2
     56 aa
     57 az
     58 3
     59 abc
     60 bca
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 Yes
     67 1
     68 1 4
     69 No
     70 No
     71 Yes
     72 3
     73 1 2
     74 3 1
     75 2 3
     76 ```