Submission #400481

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iostream>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <sstream>

using namespace std;

#define reps(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reps(i,0,n)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

int func(string str)
{
    string s = "b";
    for(int i=1; s.size() <= str.size(); ++i){
        if(i%3 == 0){
            s = "b" + s + "b";
        }
        else if(i%3 == 1){
            s = "a" + s + "c";
        }
        else{
            s = "c" + s + "a";
        }
        if(s == str){
            return i;
        }
    }

    return -1;
}

signed main()
{
    int n;
    cin >> n;

    string str;
    cin >> str;

    cout << func(str) << endl;
}

Submission Info

Judge Result