A15200 | Mark and Lightbulbs
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Mark has just purchased a rack of $n$ lightbulbs. The state of the lightbulbs can be described with binary string $s = s_1s_2\dots s_n$ , where $s_i=\texttt{1}$ means that the $i$ -th lightbulb is turned on, while $s_i=\texttt{0}$ means that the $i$ -th lightbulb is turned off.
Unfortunately, the lightbulbs are broken, and the only operation he can perform to change the state of the lightbulbs is the following:
- Select an index $i$ from $2,3,\dots,n-1$ such that $s_{i-1}\ne s_{i+1}$ .
- Toggle $s_i$ . Namely, if $s_i$ is $\texttt{0}$ , set $s_i$ to $\texttt{1}$ or vice versa.
Mark wants the state of the lightbulbs to be another binary string $t$ . Help Mark determine the minimum number of operations to do so.
Unfortunately, the lightbulbs are broken, and the only operation he can perform to change the state of the lightbulbs is the following:
- Select an index $i$ from $2,3,\dots,n-1$ such that $s_{i-1}\ne s_{i+1}$ .
- Toggle $s_i$ . Namely, if $s_i$ is $\texttt{0}$ , set $s_i$ to $\texttt{1}$ or vice versa.
Mark wants the state of the lightbulbs to be another binary string $t$ . Help Mark determine the minimum number of operations to do so.
输入格式
The first line of the input contains a single integer $q$ ( $1\leq q\leq 10^4$ ) — the number of test cases.
The first line of each test case contains a single integer $n$ ( $3\leq n\leq 2\cdot 10^5$ ) — the number of lightbulbs.
The second line of each test case contains a binary string $s$ of length $n$ — the initial state of the lightbulbs.
The third line of each test case contains a binary string $t$ of length $n$ — the final state of the lightbulbs.
It is guaranteed that the sum of $n$ across all test cases does not exceed $2\cdot 10^5$ .
The first line of each test case contains a single integer $n$ ( $3\leq n\leq 2\cdot 10^5$ ) — the number of lightbulbs.
The second line of each test case contains a binary string $s$ of length $n$ — the initial state of the lightbulbs.
The third line of each test case contains a binary string $t$ of length $n$ — the final state of the lightbulbs.
It is guaranteed that the sum of $n$ across all test cases does not exceed $2\cdot 10^5$ .
输出格式
For each test case, print a line containing the minimum number of operations Mark needs to perform to transform $s$ to $t$ . If there is no such sequence of operations, print $-1$ .
输入输出样例
输入 #1
4 4 0100 0010 4 1010 0100 5 01001 00011 6 000101 010011
输出 #1
2 -1 -1 5
In the first test case, one sequence of operations that achieves the minimum number of operations is the following.
- Select $i=3$ , changing $\texttt{01}\color{red}{\texttt{0}}\texttt{0}$ to $\texttt{01}\color{red}{\texttt{1}}\texttt{0}$ .
- Select $i=2$ , changing $\texttt{0}\color{red}{\texttt{1}}\texttt{10}$ to $\texttt{0}\color{red}{\texttt{0}}\texttt{10}$ .
In the second test case, there is no sequence of operations because one cannot change the first digit or the last digit of $s$ .In the third test case, even though the first digits of $s$ and $t$ are the same and the last digits of $s$ and $t$ are the same, it can be shown that there is no sequence of operations that satisfies the condition.
In the fourth test case, one sequence that achieves the minimum number of operations is the following:
- Select $i=3$ , changing $\texttt{00}\color{red}{\texttt{0}}\texttt{101}$ to $\texttt{00}\color{red}{\texttt{1}}\texttt{101}$ .
- Select $i=2$ , changing $\texttt{0}\color{red}{\texttt{0}}\texttt{1101}$ to $\texttt{0}\color{red}{\texttt{1}}\texttt{1101}$ .
- Select $i=4$ , changing $\texttt{011}\color{red}{\texttt{1}}\texttt{01}$ to $\texttt{011}\color{red}{\texttt{0}}\texttt{01}$ .
- Select $i=5$ , changing $\texttt{0110}\color{red}{\texttt{0}}\texttt{1}$ to $\texttt{0110}\color{red}{\texttt{1}}\texttt{1}$ .
- Select $i=3$ , changing $\texttt{01}\color{red}{\texttt{1}}\texttt{011}$ to $\texttt{01}\color{red}{\texttt{0}}\texttt{011}$ .
- Select $i=3$ , changing $\texttt{01}\color{red}{\texttt{0}}\texttt{0}$ to $\texttt{01}\color{red}{\texttt{1}}\texttt{0}$ .
- Select $i=2$ , changing $\texttt{0}\color{red}{\texttt{1}}\texttt{10}$ to $\texttt{0}\color{red}{\texttt{0}}\texttt{10}$ .
In the second test case, there is no sequence of operations because one cannot change the first digit or the last digit of $s$ .In the third test case, even though the first digits of $s$ and $t$ are the same and the last digits of $s$ and $t$ are the same, it can be shown that there is no sequence of operations that satisfies the condition.
In the fourth test case, one sequence that achieves the minimum number of operations is the following:
- Select $i=3$ , changing $\texttt{00}\color{red}{\texttt{0}}\texttt{101}$ to $\texttt{00}\color{red}{\texttt{1}}\texttt{101}$ .
- Select $i=2$ , changing $\texttt{0}\color{red}{\texttt{0}}\texttt{1101}$ to $\texttt{0}\color{red}{\texttt{1}}\texttt{1101}$ .
- Select $i=4$ , changing $\texttt{011}\color{red}{\texttt{1}}\texttt{01}$ to $\texttt{011}\color{red}{\texttt{0}}\texttt{01}$ .
- Select $i=5$ , changing $\texttt{0110}\color{red}{\texttt{0}}\texttt{1}$ to $\texttt{0110}\color{red}{\texttt{1}}\texttt{1}$ .
- Select $i=3$ , changing $\texttt{01}\color{red}{\texttt{1}}\texttt{011}$ to $\texttt{01}\color{red}{\texttt{0}}\texttt{011}$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted