Submission #2212060

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define int long long 


signed main(){
    int Ans=0;
    string S,T,U;
    cin >> S;
    int p[114514]={};
    int q[114514]={};
    int j=0,k=0;
    T=S;
    REP(i,T.size()){
        if(T[i]=='x'){
            T.erase(T.begin()+i,T.begin()+i+1);
            i--;
        }
    }
    U=T;
    reverse(U.begin(),U.end());
    if(T!=U){
        cout << -1 << endl;
        return 0;
    }
    U=S;
    reverse(U.begin(),U.end());
    
    REP(i,S.size()){
        if(S[i]=='x'){
            p[j]++;
        }else{
            j++;
        }
        if(U[i]=='x'){
            q[k]++;
        }else{
            k++;
        }
    }
    REP(i,j+1){
        Ans+=max((int)0,p[i]-q[i]);
    }
    
    cout <<Ans << endl;
    return 0;
}

Submission Info

Judge Result