codeforces-scrape

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

1503A.md (1921B)


      1 Source: https://codeforces.com/problemset/problem/1503/A
      2 
      3 A. Balance the Bits
      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 sequence of brackets is called balanced if one can turn it into a valid math expression by adding characters '+' and '1'. For example, sequences '(())()', '()', and '(()(()))' are balanced, while ')(', '(()', and '(()))(' are not.
     22 
     23 You are given a binary string $s$ of length $n$. Construct two balanced bracket sequences $a$ and $b$ of length $n$ such that for all $1\le i\le n$:
     24 
     25 * if $s_i=1$, then $a_i=b_i$
     26 * if $s_i=0$, then $a_i\ne b_i$
     27 
     28 If it is impossible, you should report about it.
     29 
     30 Input
     31 
     32 The first line contains a single integer $t$ ($1\le t\le 10^4$) — the number of test cases.
     33 
     34 The first line of each test case contains a single integer $n$ ($2\le n\le 2\cdot 10^5$, $n$ is even).
     35 
     36 The next line contains a string $s$ of length $n$, consisting of characters 0 and 1.
     37 
     38 The sum of $n$ across all test cases does not exceed $2\cdot 10^5$.
     39 
     40 Output
     41 
     42 If such two balanced bracked sequences exist, output "YES" on the first line, otherwise output "NO". You can print each letter in any case (upper or lower).
     43 
     44 If the answer is "YES", output the balanced bracket sequences $a$ and $b$ satisfying the conditions on the next two lines.
     45 
     46 If there are multiple solutions, you may print any.
     47 
     48 Example
     49 
     50 Input
     51 
     52 ```
     53 3
     54 6
     55 101101
     56 10
     57 1001101101
     58 4
     59 1100
     60 ```
     61 
     62 Output
     63 
     64 ```
     65 YES
     66 ()()()
     67 ((()))
     68 YES
     69 ()()((()))
     70 (())()()()
     71 NO
     72 ```
     73 
     74 Note
     75 
     76 In the first test case, $a=$"()()()" and $b=$"((()))". The characters are equal in positions $1$, $3$, $4$, and $6$, which are the exact same positions where $s_i=1$.
     77 
     78 In the second test case, $a=$"()()((()))" and $b=$"(())()()()". The characters are equal in positions $1$, $4$, $5$, $7$, $8$, $10$, which are the exact same positions where $s_i=1$.
     79 
     80 In the third test case, there is no solution.