codeforces-scrape

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

1399D.md (1888B)


      1 Source: https://codeforces.com/problemset/problem/1399/D
      2 
      3 D. Binary String To Subsequences
      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 binary string $s$ consisting of $n$ zeros and ones.
     22 
     23 Your task is to divide the given string into the minimum number of subsequences in such a way that each character of the string belongs to exactly one subsequence and each subsequence looks like "010101 ..." or "101010 ..." (i.e. the subsequence should not contain two adjacent zeros or ones).
     24 
     25 Recall that a subsequence is a sequence that can be derived from the given sequence by deleting zero or more elements without changing the order of the remaining elements. For example, subsequences of "1011101" are "0", "1", "11111", "0111", "101", "1001", but not "000", "101010" and "11100".
     26 
     27 You have to answer $t$ independent test cases.
     28 
     29 Input
     30 
     31 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.
     32 
     33 The first line of the test case contains one integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the length of $s$. The second line of the test case contains $n$ characters '0' and '1' — the string $s$.
     34 
     35 It is guaranteed that the sum of $n$ does not exceed $2 \cdot 10^5$ ($\sum n \le 2 \cdot 10^5$).
     36 
     37 Output
     38 
     39 For each test case, print the answer: in the first line print one integer $k$ ($1 \le k \le n$) — the minimum number of subsequences you can divide the string $s$ to. In the second line print $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le k$), where $a_i$ is the number of subsequence the $i$-th character of $s$ belongs to.
     40 
     41 If there are several answers, you can print any.
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 4
     49 4
     50 0011
     51 6
     52 111111
     53 5
     54 10101
     55 8
     56 01010000
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 2
     63 1 2 2 1 
     64 6
     65 1 2 3 4 5 6 
     66 1
     67 1 1 1 1 1 
     68 4
     69 1 1 1 1 1 2 3 4
     70 ```