Submission #2205842

---

Source Code Expand

#include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#include<limits>
#include<bitset>
#include<ctype.h>
#include<set>
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
const ll MOD=10000;
const ll INF=1000000000;
const int MAX=100001;
const double EPS=1e-10;
int main(){
    string s;
    cin>>s;
    int sl=s.length();
    int l=0;
    int r=sl-1;
    bool f=false;
    int ans=0;
    while(r-l>=1){
        if(s[r]==s[l]){
            r--;
            l++;
        }else if(s[r]=='x'){
            r--;
            ans++;
        }else if(s[l]=='x'){
            l++;
            ans++;
        }else{
            f=true;
            break;
        }
    }
    if(f){
        cout<<-1<<endl;
    }else{
        cout<<ans<<endl;
    }
    return 0;
}

Submission Info

Judge Result