提出 #73721954

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long INF = (1LL << 62) - (1LL << 31) - 1;

int main() {
    string S, T;
    cin >> S >> T;
    int sizeS = S.size(), sizeT = T.size();
    int ans = 0;
    int j = 0;
    for (int i = 0; i < sizeT; i++) {
        if (T[i] == 'A') {
            if (j >= sizeS) {
                ans++;
            }
            while(j < sizeS) {
                if (S[j] == 'A') {
                    j++;
                    break;
                } else {
                    ans++;
                    break;
                }
            }
        } else {
            if (j >= sizeS) {
                cout << -1 << "\n";
                return 0;
            }
            bool flag = false;
            while (j < sizeS) {
                if (S[j] == 'A') {
                    ans++;
                    j++;
                } else if (S[j] == T[i]) {
                    j++;
                    flag = true;
                    break;
                } else if (S[j] != T[i]) {
                    cout << -1 << "\n";
                    return 0;
                }
            }
            if (flag == false) {
                cout << -1 << "\n";
                return 0;
            }
        }
    }
    for (;j < sizeS; j++) {
        if (S[j] == 'A') {
            ans++;
        } else {
            cout << -1 << "\n";
            return 0;
        }
    }
    cout << ans << "\n";
    return 0;
}

提出情報

ジャッジ結果