codeforces-scrape

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

1615C.md (2824B)


      1 Source: https://codeforces.com/problemset/problem/1615/C
      2 
      3 C. Menorah
      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 There are $n$ candles on a Hanukkah menorah, and some of its candles are initially lit. We can describe which candles are lit with a binary string $s$, where the $i$-th candle is lit if and only if $s_i=1$.
     22 
     23  ![](https://espresso.codeforces.com/a64b634ae534f61590da22af0f8f1e6e4fa4900d.png) 
     24 
     25 Initially, the candle lights are described by a string $a$. In an operation, you select a candle that is currently lit. By doing so, the candle you selected will remain lit, and every other candle will change (if it was lit, it will become unlit and if it was unlit, it will become lit).
     26 
     27 You would like to make the candles look the same as string $b$. Your task is to determine if it is possible, and if it is, find the minimum number of operations required.
     28 
     29 Input
     30 
     31 The first line contains an integer $t$ ($1\le t\le 10^4$) — the number of test cases. Then $t$ cases follow.
     32 
     33 The first line of each test case contains a single integer $n$ ($1\le n\le 10^5$) — the number of candles.
     34 
     35 The second line contains a string $a$ of length $n$ consisting of symbols 0 and 1 — the initial pattern of lights.
     36 
     37 The third line contains a string $b$ of length $n$ consisting of symbols 0 and 1 — the desired pattern of lights.
     38 
     39 It is guaranteed that the sum of $n$ does not exceed $10^5$.
     40 
     41 Output
     42 
     43 For each test case, output the minimum number of operations required to transform $a$ to $b$, or $-1$ if it's impossible.
     44 
     45 Example
     46 
     47 Input
     48 
     49 ```
     50 5
     51 5
     52 11010
     53 11010
     54 2
     55 01
     56 11
     57 3
     58 000
     59 101
     60 9
     61 100010111
     62 101101100
     63 9
     64 001011011
     65 011010101
     66 ```
     67 
     68 Output
     69 
     70 ```
     71 0
     72 1
     73 -1
     74 3
     75 4
     76 ```
     77 
     78 Note
     79 
     80 In the first test case, the two strings are already equal, so we don't have to perform any operations.
     81 
     82 In the second test case, we can perform a single operation selecting the second candle to transform $01$ into $11$.
     83 
     84 In the third test case, it's impossible to perform any operations because there are no lit candles to select.
     85 
     86 In the fourth test case, we can perform the following operations to transform $a$ into $b$:
     87 
     88 1. Select the $7$-th candle: $100010{\color{red}1}11\to 011101{\color{red} 1}00$.
     89 2. Select the $2$-nd candle: $0{\color{red} 1}1101100\to 1{\color{red} 1}0010011$.
     90 3. Select the $1$-st candle: ${\color{red}1}10010011\to {\color{red}1}01101100$.
     91 
     92 In the fifth test case, we can perform the following operations to transform $a$ into $b$:
     93 
     94 1. Select the $6$-th candle: $00101{\color{red}1}011\to 11010{\color{red}1}100$
     95 2. Select the $2$-nd candle: $1{\color{red}1}0101100\to 0{\color{red}1}1010011$
     96 3. Select the $8$-th candle: $0110100{\color{red}1}1\to 1001011{\color{red}1}0$
     97 4. Select the $7$-th candle: $100101{\color{red}1}10\to 011010{\color{red}1}01$