Learning-algorithm/Marenol_Hard_version.cpp at main · YiHx/Learning-algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'

void solve(){
    int n;
    cin>>n;
    string a,b;
    cin>>a>>b;
    int add1 =0;
    int even1 = 0;
    int add2 = 0;
    int even2 = 0;
    bool ok = true;
    long long ans  = 0;
    for (int i =0;i<a.size();i++) {
        if (a[i] == '1') {
            if ((i+1)&1) {
                add1++;
            }else {
                even1++;
            }
        }
    }

    for (int i =0;i<b.size();i++) {
        if (b[i] == '1') {
            if ((i+1)&1) {
                add2++;
            }else {
                even2++;
            }
        }
    }


    if (!ok) {
        cout<<-1<<endl;
    }else {
        for(int k = 0; k < 2; k++) {
            vector<int> p1, p2;
            for(int i = k; i < n; i += 2) {
                if(a[i] == '1') p1.push_back(i);
                if(b[i] == '1') p2.push_back(i);
            }

            if(p1.size() != p2.size()) {
                ok = false;
                break;
            }

            for(int i = 0; i < p1.size(); i++) ans += abs(p1[i] - p2[i]);
        }
    }
    if (!ok)cout<<-1<<endl;
    else {
        cout<< ans / 2 <<endl;
    }
}
int main () {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T =1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}