Submission #3141908

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

void init();
void solve();

#define rep(i, a) for (int i = 0; i < (int) (a); i++)
#define reps(i, a, b) for (int i = (int) (a); i < (int) (b); i++)
#define rrep(i, a) for (int i = (int) a-1; i >= 0; i--)
#define rreps(i, a, b) for (int i = (int) (a)-1; i >= (int) (b); i--)
#define MP(a, b) make_pair((a), (b))
#define PB(a) push_back((a))
#define all(v) (v).begin(), (v).end()
#define PRINT(f) if((f)){cout << (TRUE__) << endl;}else{cout << FALSE__ << endl;}
#define TRUE__  "Yes"
#define FALSE__ "No"
#define PERM(v) next_permutation(all(v))
#define UNIQUE(v) sort(all(v));(v).erase(unique(all(v)), v.end())
#define CIN(type, x) type x;cin >> x

#ifdef LOCAL
#define lcout(a) cout << a
#define lcoutln(a) cout << a << endl
#define lcerr(a) cerr << a
#define lcerrln(a) cerr << a << endl
#else
#define lcout(a) 
#define lcoutln(a) 
#define lcerr(a) 
#define lcerrln(a) 
#endif
#define MOD 1000000007
#define PI 3.141592653589793238462643383

signed main()
{
	init();
	solve();
}

int N;
string s;

void init()
{
	cin >> N >> s;
}

string r;
int cnt;

bool t1()
{
	cnt++;
	r = 'a' + r + 'c';
	if (s == r) return true;
	return false;
}

bool t2()
{
	cnt++;
	r = 'c' + r + 'a';
	if (s == r) return true;
	return false;
}

bool t3()
{
	cnt++;
	r = 'b' + r + 'b';
	if (s == r) return true;
	return false;
}

void solve()
{
	r = "b";
	if (r == s) {
		cout << 0 << endl;
		return;
	}
	while (true) {
		if (t1()) break;
		if (t2()) break;
		if (t3()) break;
		if (N < r.length()) {
			cout << -1 << endl;
			return;
		}
	}
	cout << cnt << endl;
}

Submission Info

Judge Result