Submission #1303492

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
string S;
int Q;

vector<vector<int> > cc;
int dp(int l, int a) {
    if(l == S.size()) return 1e9;
    int &ret = cc[l][a];
    if(ret != -1) return ret;

    if(S[l] - 'a' == a) return ret = l + 1;
    if(S[l] - 'a' < a) {
        if(dp(l, a - 1) == 1e9) return ret = 1e9;
        else return ret = dp(dp(l, a - 1), a - 1);
    }
    else {
        if(dp(l, 26) == 1e9) return ret = 1e9;
        else return ret = dp(dp(l, 26), a);
    }
}
vector<vector<int> > db;

int main() {
    std::ios::sync_with_stdio(false);
    cin>>S>>Q;

    cc = vector<vector<int> >(S.size(), vector<int>(27, -1));
    db = vector<vector<int> >(S.size(), vector<int>(20, 1e9));
    for(int i = S.size() - 1; i >= 0; i--) {
        db[i][0] = dp(i, 26);
        for(int j = 1; j < 20; j++) {
            int t = db[i][j - 1];
            if(t == S.size() || t == 1e9) break;
            db[i][j] = db[t][j - 1];
        }
    }
    while(Q--) {
        int l, r; cin>>l>>r;
        l--;

        int p = l;
        for(int i = 20; i--;) {
            if(p != S.size() && db[p][i] <= r) {
                p = db[p][i];
            }
        }
        if(p == r) printf("Yes\n");
        else printf("No\n");
    }
}

Submission Info

Judge Result