codeforces-scrape

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

1864B.md (2706B)


      1 Source: https://codeforces.com/problemset/problem/1864/B
      2 
      3 B. Swap and Reverse
      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 You are given a string $s$ of length $n$ consisting of lowercase English letters, and an integer $k$. In one step you can perform any one of the two operations below:
     22 
     23 * Pick an index $i$ ($1 \le i \le n - 2$) and swap $s_{i}$ and $s_{i+2}$.
     24 * Pick an index $i$ ($1 \le i \le n-k+1$) and reverse the order of letters formed by the range $[i,i+k-1]$ of the string. Formally, if the string currently is equal to $s_1\ldots s_{i-1}s_is_{i+1}\ldots s_{i+k-2}s_{i+k-1}s_{i+k}\ldots s_{n-1}s_n$, change it to $s_1\ldots s_{i-1}s_{i+k-1}s_{i+k-2}\ldots s_{i+1}s_is_{i+k}\ldots s_{n-1}s_n$.
     25 
     26 You can make as many steps as you want (possibly, zero). Your task is to find the lexicographically smallest string you can obtain after some number of steps.
     27 
     28 A string $a$ is lexicographically smaller than a string $b$ of the same length if and only if the following holds:
     29 
     30 * in the first position where $a$ and $b$ differ, the string $a$ has a letter that appears earlier in the alphabet than the corresponding letter in $b$.
     31 
     32 Input
     33 
     34 Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^4$). The description of the test cases follows.
     35 
     36 The first line of each test case contains two integers $n$ and $k$ ($1 \le k \lt n \le 10^5$).
     37 
     38 The second line of each test case contains the string $s$ of length $n$ consisting of lowercase English letters.
     39 
     40 It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$.
     41 
     42 Output
     43 
     44 For each test case, print the lexicographically smallest string after doing some (possibly, zero) steps.
     45 
     46 Example
     47 
     48 Input
     49 
     50 ```
     51 5
     52 
     53 4 2
     54 
     55 nima
     56 
     57 5 3
     58 
     59 panda
     60 
     61 9 2
     62 
     63 theforces
     64 
     65 7 3
     66 
     67 amirfar
     68 
     69 6 4
     70 
     71 rounds
     72 ```
     73 
     74 Output
     75 
     76 ```
     77 aimn
     78 aandp
     79 ceefhorst
     80 aafmirr
     81 dnorsu
     82 ```
     83 
     84 Note
     85 
     86 In the first test case, we can obtain the string "aimn" using the following operations:
     87 
     88 1. Reverse the range $[3,4]$. The string turns into "niam".
     89 2. Swap $s_1$ and $s_3$. The string turns into "ainm".
     90 3. Reverse the range $[3,4]$. The string turns into "aimn".
     91 
     92 It can be proven that we cannot obtain any string lexicographically smaller than "aimn". Therefore, "aimn" is the answer.
     93 
     94 In the second test case, we can obtain the string "aandp" using the following operations:
     95 
     96 1. Swap $s_3$ and $s_5$. The string turns into "paadn".
     97 2. Swap $s_1$ and $s_3$. The string turns into "aapdn".
     98 3. Swap $s_3$ and $s_5$. The string turns into "aandp".
     99 
    100 It can be proven that we cannot obtain any string lexicographically smaller than "aandp". Therefore, "aandp" is the answer.