Learning-algorithm/Inversion_of_a_Subsequence.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
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'

void solve(){
    int n;
    cin>>n;
    vector<int> a(n);
    vector<int> b(n);
    long long cnt1 = 0;
    long long cnt2 = 0;

    for (int i =0;i<n;i++) {
        cin>>a[i];
        cnt1+=a[i];
    }
    for (int i =0;i<n;i++) {
        cin>>b[i];
        cnt2+=b[i];
    }
    if (a == b) {
        cout<<0<<endl;
        return;
    }

    int ans = 0;
    for (int i =0;i<n;i++) {
        if(a[i]!=b[i]) {
            ans+=a[i];
        }
    }
    if (cnt2 == n && cnt1!=n) {
        cout<<-1<<endl;
        return;
    }
    if (cnt1 ==0 && cnt2!=0) {
        cout<<-1<<endl;
        return;
    }
    if (ans == 0 && n == 2) {
        cout<<-1<<endl;
        return;
    }
        if (ans%2 == 0) {
            cout<<2<<endl;
        }else {
            cout<<1<<endl;
        }

}
int main () {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T =1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}