codeforces-scrape

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

1385D.md (2887B)


      1 Source: https://codeforces.com/problemset/problem/1385/D
      2 
      3 D. a-Good String
      4 
      5 time limit per test
      6 
      7 2 seconds
      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[1 \dots n]$ consisting of lowercase Latin letters. It is guaranteed that $n = 2^k$ for some integer $k \ge 0$.
     22 
     23 The string $s[1 \dots n]$ is called $c$-good if at least one of the following three conditions is satisfied:
     24 
     25 * The length of $s$ is $1$, and it consists of the character $c$ (i.e. $s_1=c$);
     26 * The length of $s$ is greater than $1$, the first half of the string consists of only the character $c$ (i.e. $s_1=s_2=\dots=s_{\frac{n}{2}}=c$) and the second half of the string (i.e. the string $s_{\frac{n}{2} + 1}s_{\frac{n}{2} + 2} \dots s_n$) is a $(c+1)$-good string;
     27 * The length of $s$ is greater than $1$, the second half of the string consists of only the character $c$ (i.e. $s_{\frac{n}{2} + 1}=s_{\frac{n}{2} + 2}=\dots=s_n=c$) and the first half of the string (i.e. the string $s_1s_2 \dots s_{\frac{n}{2}}$) is a $(c+1)$-good string.
     28 
     29 For example: "aabc" is 'a'-good, "ffgheeee" is 'e'-good.
     30 
     31 In one move, you can choose one index $i$ from $1$ to $n$ and replace $s_i$ with any lowercase Latin letter (any character from 'a' to 'z').
     32 
     33 Your task is to find the minimum number of moves required to obtain an 'a'-good string from $s$ (i.e. $c$-good string for $c=$ 'a'). It is guaranteed that the answer always exists.
     34 
     35 You have to answer $t$ independent test cases.
     36 
     37 Another example of an 'a'-good string is as follows. Consider the string $s = $"cdbbaaaa". It is an 'a'-good string, because:
     38 
     39 * the second half of the string ("aaaa") consists of only the character 'a';
     40 * the first half of the string ("cdbb") is 'b'-good string, because:
     41   + the second half of the string ("bb") consists of only the character 'b';
     42   + the first half of the string ("cd") is 'c'-good string, because:
     43     - the first half of the string ("c") consists of only the character 'c';
     44     - the second half of the string ("d") is 'd'-good string.
     45 
     46 Input
     47 
     48 The first line of the input contains one integer $t$ ($1 \le t \le 2 \cdot 10^4$) — the number of test cases. Then $t$ test cases follow.
     49 
     50 The first line of the test case contains one integer $n$ ($1 \le n \le 131~072$) — the length of $s$. It is guaranteed that $n = 2^k$ for some integer $k \ge 0$. The second line of the test case contains the string $s$ consisting of $n$ lowercase Latin letters.
     51 
     52 It is guaranteed that the sum of $n$ does not exceed $2 \cdot 10^5$ ($\sum n \le 2 \cdot 10^5$).
     53 
     54 Output
     55 
     56 For each test case, print the answer — the minimum number of moves required to obtain an 'a'-good string from $s$ (i.e. $c$-good string with $c =$ 'a'). It is guaranteed that the answer exists.
     57 
     58 Example
     59 
     60 Input
     61 
     62 ```
     63 6
     64 8
     65 bbdcaaaa
     66 8
     67 asdfghjk
     68 8
     69 ceaaaabb
     70 8
     71 bbaaddcc
     72 1
     73 z
     74 2
     75 ac
     76 ```
     77 
     78 Output
     79 
     80 ```
     81 0
     82 7
     83 4
     84 5
     85 1
     86 1
     87 ```