给定两个长度为n的字符串s，t，每次操作：选择i(1 ＜ i ＜ n), 满足s[i - 1] != s[i + 1], 使s[i] ^= 1。求使s，t相同的最少操作次数或者输出-1

题目

思路：

#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
#define pb push_back
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, maxm = 5e3 + 5;
int a[maxn];
int n, m;
string s;
bool tag[maxn];
int d[maxn];
void solve()
{
	int n;
	cin >> n;
	cin >> s;
	string t;
	cin >> t;
	t = " " + t;
	s = " " + s;
	vector<int> a, b;
	for(int i = 2; i <= n; i++){
		if(s[i] != s[i - 1]){
			a.pb(i);
		}
		if(t[i] != t[i - 1]){
			b.pb(i);
		}
	}
	if(s[0] != t[0] || s[n] != t[n] || a.size() != b.size()){
		cout << "-1\n";
		return;
	}
	int res = 0;
	for(int i = 0; i < a.size(); i++){
		res += abs(a[i] - b[i]);
	}
	cout << res << '\n';
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int T = 1;
	cin >> T;
	// for(int i = 1; i <= T; i++){
	// 	num = i;
	// 	solve();
	// }
	while (T--)
	{
		solve();
	}
}