結果

問題 No.3244 Range Multiple of 8 Query
コンテスト
ユーザー GOTKAKO
提出日時 2025-08-22 21:30:16
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 1,080 ms / 5,000 ms
コード長 4,121 bytes
コンパイル時間 2,208 ms
コンパイル使用メモリ 207,524 KB
実行使用メモリ 23,972 KB
最終ジャッジ日時 2025-08-22 21:30:39
合計ジャッジ時間 22,318 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

//入力が必ず-mod<a<modの時.
template<const int mod>
struct modint{ //mod変更が不可能.
    public:
    long long v = 0;
    static void setmod(int m){} //飾り.
    static constexpr long long getmod(){return mod;}
    modint(){v = 0;} modint(int a){v = a<0?a+mod:a;} modint(long long a){v = a<0?a+mod:a;}
    modint(unsigned int a){v = a;} modint(unsigned long long a){v = a;}
    long long val()const{return v;}
 
    modint &operator=(const modint &b) = default;
    modint operator+()const{return (*this);}
    modint operator-()const{return modint(0)-(*this);}
    modint operator+(const modint b)const{return modint(v)+=b;}
    modint operator-(const modint b)const{return modint(v)-=b;}
    modint operator*(const modint b)const{return modint(v)*=b;}
    modint operator/(const modint b)const{return modint(v)/=b;}
    modint operator+=(const modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    modint operator-=(const modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    modint operator*=(const modint b){v = v*b.v%mod; return *this;}
    modint operator/=(modint b){ //b!=0 mod素数が必須.
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
    modint operator++(){*this += 1; return *this;}
    modint operator--(){*this -= 1; return *this;}
    modint operator++(int){*this += 1; return *this;}
    modint operator--(int){*this -= 1; return *this;}
    bool operator==(const modint b)const{return v == b.v;}
    bool operator!=(const modint b)const{return v != b.v;}
    bool operator>(const modint b)const{return v > b.v;}
    bool operator>=(const modint b)const{return v >= b.v;}
    bool operator<(const modint b)const{return v < b.v;}
    bool operator<=(const modint b)const{return v <= b.v;}
    modint pow(long long n)const{
        modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    modint inv()const{return modint(1)/v;} //素数mod必須.
};
using mint = modint<998244353>; const long long mod = 998244353;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,Q; cin >> N >> Q;
    string s; cin >> s;
    vector<vector<int>> B(N+1,vector<int>(10,-1));
    for(int i=1; i<=N; i++){
        for(int k=0; k<10; k++) B.at(i).at(k) = B.at(i-1).at(k);
        int c = s.at(i-1)-'0';
        B.at(i).at(c) = i-1;
    }
    
    vector<string> check;
    for(int i=0; i<1000; i+=8){
        string v = to_string(i);
        reverse(v.begin(),v.end());
        while(v.size() < 3) v += '0';
        check.push_back(v);

    }
    while(Q--){
        int l,r; cin >> l >> r; l--,r--;
        if(l == r){
            if(s.at(l) == '8' || s.at(l) == '0') cout << "0\n";
            else cout << "-1\n";
            continue;
        }
        if(l+1 == r){
            int v = s.at(l)-'0',v2 = s.at(r)-'0';
            if((v*10+v2)%8 == 0) cout << "0\n";
            else if((v2*10+v)%8 == 0) cout << "1\n";
            else cout << "-1\n";
            continue;
        }
        r++;
        int answer = 1001001001;
        for(auto v : check){
            int p1 = B.at(r).at(v.at(0)-'0');
            if(p1 == -1) continue;
            int p2 = B.at(r).at(v.at(1)-'0');
            if(v.at(0) == v.at(1)) p2 = B.at(p1).at(v.at(1)-'0');
            if(p2 == -1) continue;
            int p3 = B.at(r).at(v.at(2)-'0');
            if(v.at(1) == v.at(2)) p3 = B.at(p2).at(v.at(2)-'0');
            else if(v.at(0) == v.at(2)) p3 = B.at(p1).at(v.at(2)-'0');
            if(min({p1,p2,p3}) < l) continue;

            int now = r-1-p1;
            if(p1 < p2) p2--;
            if(p1 < p3) p3--;
            now += r-2-p2;
            if(p2 < p3) p3--;
            now += r-3-p3;
            answer = min(answer,now); 
        }
        if(answer == 1001001001) cout << "-1\n";
        else cout << answer << "\n";
    }
}
0