codeforces-scrape

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

1566C.md (2466B)


      1 Source: https://codeforces.com/problemset/problem/1566/C
      2 
      3 C. MAX-MEX Cut
      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 A binary string is a string that consists of characters $0$ and $1$. A bi-table is a table that has exactly two rows of equal length, each being a binary string.
     22 
     23 Let $\operatorname{MEX}$ of a bi-table be the smallest digit among $0$, $1$, or $2$ that does not occur in the bi-table. For example, $\operatorname{MEX}$ for $\begin{bmatrix} 0011\\ 1010 \end{bmatrix}$ is $2$, because $0$ and $1$ occur in the bi-table at least once. $\operatorname{MEX}$ for $\begin{bmatrix} 111\\ 111 \end{bmatrix}$ is $0$, because $0$ and $2$ do not occur in the bi-table, and $0 \lt 2$.
     24 
     25 You are given a bi-table with $n$ columns. You should cut it into any number of bi-tables (each consisting of consecutive columns) so that each column is in exactly one bi-table. It is possible to cut the bi-table into a single bi-table — the whole bi-table.
     26 
     27 What is the maximal sum of $\operatorname{MEX}$ of all resulting bi-tables can be?
     28 
     29 Input
     30 
     31 The input consists of multiple test cases. The first line contains a single integer $t$ ($1 \le t \le 10^4$) — the number of test cases. Description of the test cases follows.
     32 
     33 The first line of the description of each test case contains a single integer $n$ ($1 \le n \le 10^5$) — the number of columns in the bi-table.
     34 
     35 Each of the next two lines contains a binary string of length $n$ — the rows of the bi-table.
     36 
     37 It's guaranteed that the sum of $n$ over all test cases does not exceed $10^5$.
     38 
     39 Output
     40 
     41 For each test case print a single integer — the maximal sum of $\operatorname{MEX}$ of all bi-tables that it is possible to get by cutting the given bi-table optimally.
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 4
     49 7
     50 0101000
     51 1101100
     52 5
     53 01100
     54 10101
     55 2
     56 01
     57 01
     58 6
     59 000000
     60 111111
     61 ```
     62 
     63 Output
     64 
     65 ```
     66 8
     67 8
     68 2
     69 12
     70 ```
     71 
     72 Note
     73 
     74 In the first test case you can cut the bi-table as follows:
     75 
     76 * $\begin{bmatrix} 0\\ 1 \end{bmatrix}$, its $\operatorname{MEX}$ is $2$.
     77 * $\begin{bmatrix} 10\\ 10 \end{bmatrix}$, its $\operatorname{MEX}$ is $2$.
     78 * $\begin{bmatrix} 1\\ 1 \end{bmatrix}$, its $\operatorname{MEX}$ is $0$.
     79 * $\begin{bmatrix} 0\\ 1 \end{bmatrix}$, its $\operatorname{MEX}$ is $2$.
     80 * $\begin{bmatrix} 0\\ 0 \end{bmatrix}$, its $\operatorname{MEX}$ is $1$.
     81 * $\begin{bmatrix} 0\\ 0 \end{bmatrix}$, its $\operatorname{MEX}$ is $1$.
     82 
     83 The sum of $\operatorname{MEX}$ is $8$.