1615-C

Problem - C - Codeforces

 

풀이

 

#include <bits/stdc++.h>
#define endl "\n"
#define ooop(i, n) for(int i = 0; i < n; i++)
#define loop(i, n) for(int i = 1; i <= n; i++)
#define all(v) (v).begin(), (v).end()
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
 
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        string a, b;
        cin >> a >> b;
 
        int diff_cnt = 0;
        int diff_one = 0;
        int same_one = 0;
        ooop(i, n){
            if(a[i] != b[i]){
                if(a[i] == '1') diff_one++;
                diff_cnt++;
            }
            else{
                if(a[i] == '1') same_one++;
            }
        }
        int same_cnt = n - diff_cnt;
        int diff_zero = diff_cnt - diff_one;
        int same_zero = same_cnt - same_one;
 
        int flag_diff = -1;
        if(diff_cnt % 2 == 0 && 0 <= diff_one - diff_zero && diff_one - diff_zero <= 1) flag_diff = diff_cnt;
 
        int flag_same = -1;
        if(same_cnt % 2 == 1 && 0 <= same_one - same_zero && same_one - same_zero <= 1) flag_same = same_cnt;
 
        if(max(flag_diff, flag_same) == -1) cout << -1 << endl;
        else{
            if(flag_diff == -1) cout << flag_same << endl;
            else if(flag_same == -1) cout << flag_diff << endl;
            else{
                cout << min(flag_same, flag_diff) << endl;
            }
        }
    }
 
    return 0;
}cs