Submission #401355

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,b)  FOR(i,0,b)
#define X real()
#define Y imag()
#define S second;
#define F first;
#define PB(a) push_back(a)
#define BE(c) c.begin(),c.end()
using namespace std;
typedef long long LL;
typedef pair<int,int> pr;
typedef pair<pr,int> ppr;
typedef priority_queue<pr,vector<pr>,greater<pr> > PQ;
typedef vector<pr> Vpr;
typedef vector<LL> VI;
typedef complex<LL> cld;
typedef vector<cld> Vcld;
const int SIZE=1000010;
const LL INF=1<<28;
bool maps[101][101];
int dx[]={0,1,0,-1},dy[]={1,0,-1,0};
int main(){	
	int N;
	string s;
	cin >> N;
	cin >> s;
	N=s.size();
	bool bad=false;
	if(N&1==0) cout << -1 << endl;
	else if(s[N/2]!='b') cout << -1 << endl;
	else{
		REP(i,N-1)
			if((s[i+1]=='c' && s[i]=='b')||(s[i+1]=='b' && s[i]=='a')||(s[i+1]=='a' && s[i]=='c') );
			else bad=true;
		if(!bad)
			cout << N/2 << endl;
		else
			cout << -1 << endl;
	}
}

Submission Info

Judge Result