Submission #4033094

---

Source Code Expand

#include "bits/stdc++.h"

using namespace std;

void solve()
{
	string s, t1, t2;
	cin >> s;
	int l = s.size(), xcnt = 0;
	for (int i = 0; i < l; i++)
	{
		if (s[i]=='x')
		{
			xcnt++;
			continue;
		}
		t1.push_back(s[i]);
	}
	t2 = t1;
	reverse(t2.begin(), t2.end());
	if (t1 != t2)
	{
		cout << -1 << endl;
		return;
	}
	int ans = xcnt, j = 0;
	t1 = t2 = s;
	reverse(t2.begin(), t2.end());
	for (int i = 0; i < l && j < l && i+j < l; i++, j++)
	{
		if (t1[i] == 'x' && t2[j] == 'x')
		{
			ans -= 2 - (i+j == l-1);
		}
		else
		{
			while (t1[i] == 'x')
			{
				i++;
			}
			while (t2[j] == 'x')
			{
				j++;
			}
		}
	}
	cout << ans << endl;
}

int main(void)
{
	solve();
	//cout << "yui(*-v・)yui" << endl;
	return 0;
}

Submission Info

Judge Result