Submission #73686205

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
//#include <numeric>
#include <queue>
//#include <ranges>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define pb push_back
#define fr first
#define sc second
#define sor(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int,int>;
//using pll = pair<ll,ll>;
//using pqdec = priority_queue<int,vector<int>,greater<int>>;
//using pqdecl = priority_queue<ll,vector<ll>,greater<ll>>;
template <typename T>
using graph = vector<vector<T>>;
const ll LLMAX = 9223372*1e10;
const int IMAX = 214*1e7;
/*--------考察--------------------
----------CODING----------------*/
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s,t; cin >> s >> t;
    string ss,tt;
    rep(i,ssize(s)){
        if(s[i]!='A') ss.pb(s[i]);
    }
    rep(i,ssize(t)){
        if(t[i] !='A') tt.pb(t[i]);
    }
    if(ss != tt){
        cout << -1 << endl;
        return 0;
    }
    vector<int> sv(1),tv(1);
    int idx = 0;
    rep(i,ssize(s)){
        if(s[i] =='A') sv[idx]++;
        else{
            idx++;
            sv.pb(0);
        }
    }
    idx = 0;
    rep(i,ssize(t)){
        if(t[i] =='A') tv[idx]++;
        else{
            idx++;
            tv.pb(0);
        }
    }
    int ans = 0;
    rep(i,ssize(sv)){
        ans += abs(sv[i] - tv[i]);
    }
    cout << ans << endl;
}

Submission Info

Judge Result