Submission #19521567

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int Inf = 1000000030;
constexpr ll INF= 2000000000000000000;
constexpr ll MOD = 998244353;
const double PI = 3.1415926535897;
typedef pair<int,int> P;
typedef pair<int,P> PP;

template<class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}

template<class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

ll mod(ll val, ll M) {
    val = val % M;
    if(val < 0) {
        val += M;
    }
    return val;
}

template<typename T>
T RS(T N, T P, T M){
    if(P == 0) {
        return 1;
    }
    if(P < 0) {
        return 0;
    }
    if(P % 2 == 0){
        ll t = RS(N, P/2, M);
        if(M == -1) return t * t;
        return t * t % M;
    }
    if(M == -1) {
        return N * RS(N,P - 1,M);
    }
    return N * RS(N, P-1, M) % M;
}

int three[15];

int N,Q;
int dist[2000010];

int encode(string S) {
    int res = 0;
    for(int i = 0;i < N;i++) {
        res += (S[i] - 'A') * three[i];
    }
    return res;
}

string decode(int A) {
    string res;
    for(int i = 0;i < N;i++) {
        res.push_back('A' + A % 3);
        A /= 3;
    }
    return res;
}

int main() {
    cin >> N >> Q;
    three[0] = 1;
    for(int i = 1;i < 15;i++) {
        three[i] = 3 * three[i - 1];
    }
    for(int i = 0;i < 2000010;i++) {
        dist[i] = -1;
    }
    queue<int> que;
    for(int i = 0;i <= N;i++) {
        for(int j = 0;i + j <= N;j++) {
            int k = N - i - j;
            string cnt;
            for(int l = 0;l < i;l++) {
                cnt.push_back('A');
            }
            for(int l = 0;l < j;l++) {
                cnt.push_back('B');
            }
            for(int l = 0;l < k;l++) {
                cnt.push_back('C');
            }
            int cnt2 = encode(cnt);
            dist[cnt2] = 0;
            que.push(cnt2);
        }
    }
    while(!que.empty()) {
        int cur = que.front();
        que.pop();
        string S = decode(cur);
        for(int k = 2;k <= N;k++) {
            string T = S;
            reverse(T.begin(),T.begin() + k);
            int to = encode(T);
            if(dist[to] != -1) continue;
            dist[to] = dist[cur] + 1;
            que.push(to);
        }
    }
    for(int i = 0;i < Q;i++) {
        string S;
        cin >> S;
        int cnt = 0;
        for(int j = 0;j < N;j++) {
            cnt += (S.at(j) - 'A') * three[j];
        }
        cout << dist[cnt] << endl;
    }
}

Submission Info

Judge Result