好像在打这场前在atc上做了道特别ex的翻转问题(要建图跑差分约束系统),然后碰到这么一道水题往很难的方向想了。。。
本质上偶数步操作就是每两步操作将1个1和1个0的位置互换,因此只要比两个串1个数,不同1位置即可。
奇数步操作则尝试找一个答案串里有的1位置保留,没有的话就任意找一个,然后整个串取反,接着按偶数串做即可
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define sc second
#define pb push_back
#define ll long long
#define trav(v,x) for(auto v:x)
#define all(x) (x).begin(), (x).end()
#define VI vector<int>
#define VLL vector<ll>
#define pll pair<ll, ll>
#define double long double
//#define int long long
using namespace std;
const int N = 1e6 + 100;
const ll inf = 1e18;
const ll mod = 998244353;//1e9 + 7;
#ifdef LOCAL
void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T)
{
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
void sol()
{
int n;
cin >> n;
string s, t;
cin >> s >> t;
int num[2] = {0, 0};
for(int i = 0; i < n; i++)
num[0] += (s[i] == '1');
for(int i = 0; i < n; i++)
num[1] += (t[i] == '1');
int ans = 1e9;
if(num[0] == num[1])
{
int need = num[0];
for(int i = 0; i < n; i++)
if(s[i] == '1' && s[i] == t[i])
--need;
ans = min(ans, need * 2);
}
if(n - num[0] + 1 == num[1])
{
int need = n - num[0];
int ex = 1;
for(int i = 0; i < n; i++)
if(s[i] == '1' && s[i] == t[i])
ex = 0;
for(int i = 0; i < n; i++)
if(s[i] == '0' && t[i] == '1')
--need;
need += ex;
ans = min(ans, need * 2 + 1);
}
if(ans == 1e9)
ans = -1;
cout << ans << '\n';
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);
int tt;
cin >> tt;
while(tt--)
sol();
}