Submission #1706479

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <set>
#include <vector>
#include <map>
#include <cmath>
#include <algorithm>
#include <memory.h>
#include <string>
#include <sstream>
#include <cstdlib>
#include <ctime>
#include <cassert>

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;

#define MP make_pair
#define PB push_back
#define FF first
#define SS second

#define FORN(i, n) for (int i = 0; i <  (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD(i, n) for (int i = (int)(n) - 1; i >= 0; i--)

#define DEBUG(X) { cout << #X << " = " << (X) << endl; }
#define PR0(A,n) { cout << #A << " = "; FORN(_,n) cout << A[_] << ' '; cout << endl; }

#define MOD 1000000007
#define INF 2000000000

int GLL(LL& x) {
    return scanf("%lld", &x);
}

int GI(int& x) {
    return scanf("%d", &x);
}

string s;

vector<pair<char, int>> fwd, bwd;

int main() {
    cin >> s;

    int n = s.size();

    FORN(i, n) bwd.PB(MP(s[i], i));

    fwd = bwd;
    reverse(fwd.begin(), fwd.end());

    int res = 0;

    while (!fwd.empty() && !bwd.empty() && fwd.back().SS < bwd.back().SS) {
        if (fwd.back().FF == bwd.back().FF) {
            fwd.pop_back();
            bwd.pop_back();
        }
        else if (fwd.back().FF == 'x') {
            fwd.pop_back();
            res++;
        }
        else if (bwd.back().FF == 'x') {
            bwd.pop_back();
            res++;
        }
        else {
            printf("-1\n");
            return 0;
        }
    }

    printf("%d\n", res);

    return 0;
}

Submission Info

Judge Result