Submission #73688647

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

void O_O() {
    string s, t;
    cin >> s >> t;
    int n = s.size(), m = t.size();

    int p1 = 0, p2 = 0, ans = 0;
    while (p1 < n && p2 < m) {
        if (s[p1] != t[p2]) {
            if (s[p1] == 'A') p1++;
            else if (t[p2] == 'A') p2++;
            else return void (cout << -1);
            ans++;
        } else {
            p1++, p2++;
        }
    }

    if (p1 < n) {
        int c = 0, c2 = 0;
        while (p1 < n) c += (s[p1] != 'A'), c2++, p1++;
        if (c) return void (cout << -1);
        ans += c2;
    }

    if (p2 < m) {
        int c = 0, c2 = 0;
        while (p2 < m) c += (t[p2] != 'A'), c2++, p2++;
        if (c) return void (cout << -1);
        ans += c2;
    }
    cout << ans;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int TC = 1;
    // cin >> TC
    while (TC--) {
        O_O();
        if (TC) cout << '\n';
    }

    return 0;
}

Submission Info

Judge Result