A14694 | Menorah
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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$ .
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).
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.
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).
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.
输入格式
The first line contains an integer $t$ ( $1\le t\le 10^4$ ) — the number of test cases. Then $t$ cases follow.
The first line of each test case contains a single integer $n$ ( $1\le n\le 10^5$ ) — the number of candles.
The second line contains a string $a$ of length $n$ consisting of symbols 0 and 1 — the initial pattern of lights.
The third line contains a string $b$ of length $n$ consisting of symbols 0 and 1 — the desired pattern of lights.
It is guaranteed that the sum of $n$ does not exceed $10^5$ .
The first line of each test case contains a single integer $n$ ( $1\le n\le 10^5$ ) — the number of candles.
The second line contains a string $a$ of length $n$ consisting of symbols 0 and 1 — the initial pattern of lights.
The third line contains a string $b$ of length $n$ consisting of symbols 0 and 1 — the desired pattern of lights.
It is guaranteed that the sum of $n$ does not exceed $10^5$ .
输出格式
For each test case, output the minimum number of operations required to transform $a$ to $b$ , or $-1$ if it's impossible.
输入输出样例
输入 #1
5 5 11010 11010 2 01 11 3 000 101 9 100010111 101101100 9 001011011 011010101
输出 #1
0 1 -1 3 4
In the first test case, the two strings are already equal, so we don't have to perform any operations.
In the second test case, we can perform a single operation selecting the second candle to transform $01$ into $11$ .
In the third test case, it's impossible to perform any operations because there are no lit candles to select.
In the fourth test case, we can perform the following operations to transform $a$ into $b$ :
1. Select the $7$ -th candle: $100010{\color{red}1}11\to 011101{\color{red} 1}00$ .
2. Select the $2$ -nd candle: $0{\color{red} 1}1101100\to 1{\color{red} 1}0010011$ .
3. Select the $1$ -st candle: ${\color{red}1}10010011\to {\color{red}1}01101100$ .
In the fifth test case, we can perform the following operations to transform $a$ into $b$ :
1. Select the $6$ -th candle: $00101{\color{red}1}011\to 11010{\color{red}1}100$
2. Select the $2$ -nd candle: $1{\color{red}1}0101100\to 0{\color{red}1}1010011$
3. Select the $8$ -th candle: $0110100{\color{red}1}1\to 1001011{\color{red}1}0$
4. Select the $7$ -th candle: $100101{\color{red}1}10\to 011010{\color{red}1}01$
In the second test case, we can perform a single operation selecting the second candle to transform $01$ into $11$ .
In the third test case, it's impossible to perform any operations because there are no lit candles to select.
In the fourth test case, we can perform the following operations to transform $a$ into $b$ :
1. Select the $7$ -th candle: $100010{\color{red}1}11\to 011101{\color{red} 1}00$ .
2. Select the $2$ -nd candle: $0{\color{red} 1}1101100\to 1{\color{red} 1}0010011$ .
3. Select the $1$ -st candle: ${\color{red}1}10010011\to {\color{red}1}01101100$ .
In the fifth test case, we can perform the following operations to transform $a$ into $b$ :
1. Select the $6$ -th candle: $00101{\color{red}1}011\to 11010{\color{red}1}100$
2. Select the $2$ -nd candle: $1{\color{red}1}0101100\to 0{\color{red}1}1010011$
3. Select the $8$ -th candle: $0110100{\color{red}1}1\to 1001011{\color{red}1}0$
4. Select the $7$ -th candle: $100101{\color{red}1}10\to 011010{\color{red}1}01$
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted