Submission #1127501

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<stack>
#define REP(i, N) for(int i = 0; i < N; ++i)
#define REEP(i, N) for(int i = N - 1; i >= 0; --i)
#define ALL(a) (a).begin(),(a).end()
#define FOR(i,m,n) for(int i = m; i < n; ++i)
#define RFOR(i,m,n) for(int i = n - 1; i >= m; --i)
#define CIN(a) cin >> a
#define CIN2(a, b) cin >> a >> b
#define CIN3(a, b, c) cin >> a >> b >> c
#define COUT(a) cout << a << endl
#define COUT2(a, b) cout << a << " " << b << endl
#define COUT3(a, b, c) cout << a << " " << b << " " << c << endl
#define pb push_back
#define PB push_back
#define VINT(v, n) vector<int> v(n); REP(i, n) { v[i] = 0 }
#define VINT2(v, n, m) vector<vector<int> > v(n, vector<int>(m)); REP(i, n) { REP(j, m) { v[i][j] = 0 } }
#define VCHAR(v, n) vector<char>v(n)
#define KIRIAGE(a, b) a += (b - a % b) % b
#define CEIL(c, a, b) if(a % b == 0) { c = a / b;} else { c = a / b + 1;}
#define sp(n) setprecision(n)
#define INF 1000000000
#define MOD 1000000007

using namespace std;
typedef pair<int, int> P;
typedef long long ll;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
	int N;
	CIN(N);
	string S;
	CIN(S);
	if(N % 2 == 0) {
		COUT(-1);
		return 0;
	}
	int c = -1;
	bool f = true;
	REP(i, N / 2 + 1) {
		switch(i % 3) {
			case 0 :
				if(S[N / 2 - i] == 'b' && S[N / 2 + i] == 'b') ++c;
				else f = false;
				break;
			case 1 :
				if(S[N / 2 - i] == 'a' && S[N / 2 + i] == 'c') ++c;
				else f = false;
				break;
			case 2 :
				if(S[N / 2 - i] == 'c' && S[N / 2 + i] == 'a') ++c;
				else f = false;
				break;
		}
		if(!f) break;
	}
	if(f) COUT(c);
	else COUT(-1);
}

Submission Info

Judge Result