結果

問題 No.3244 Range Multiple of 8 Query
ユーザー Yudai0606Nazo
提出日時 2025-08-25 21:40:10
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2,318 ms / 5,000 ms
コード長 3,224 bytes
コンパイル時間 4,645 ms
コンパイル使用メモリ 256,000 KB
実行使用メモリ 7,716 KB
最終ジャッジ日時 2025-08-25 21:40:55
合計ジャッジ時間 43,145 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff #

#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    string s;
    cin >> n >> q >> s;
    vector<vector<int>> id(10);
    rep(i, n) id[s[i]-'0'].push_back(i);
    rep(i, 10) id[i].push_back(n);

    while(q--) {
        int l, r;
        cin >> l >> r;
        l--;
        if(r - l == 2) {
            if(stoi(s.substr(l, 2)) % 8 == 0) cout << "0\n";
            else if(stoi(string(1, s[l+1]) + s[l]) % 8 == 0) cout << "1\n";
            else cout << "-1\n";
            continue;
        }
        if(r - l == 1) {
            int tmp = s[l] - '0';
            if(tmp == 0 || tmp == 8) cout << "0\n";
            else cout << "-1\n";
            continue;
        }
        vector<int> vl(10), vr(10);
        rep(i, 10) vl[i] = lower_bound(all(id[i]), l) - id[i].begin();
        rep(i, 10) vr[i] = lower_bound(all(id[i]), r) - id[i].begin();
        const int INF = 1e9;
        int ans = INF;
        rep(i, 125) {
            string t = to_string(i*8);
            while(t.size() < 3) t = '0' + t;
            if(t[0] == t[1] && t[1] == t[2] && vr[t[0]-'0'] - vl[t[0]-'0'] < 3) continue;
            if(t[0] == t[1] && vr[t[0]-'0'] - vl[t[0]-'0'] < 2) continue;
            if(t[0] == t[2] && vr[t[0]-'0'] - vl[t[0]-'0'] < 2) continue;
            if(t[1] == t[2] && vr[t[1]-'0'] - vl[t[1]-'0'] < 2) continue;
            if(vr[t[0]-'0'] - vl[t[0]-'0'] < 1) continue;
            if(vr[t[1]-'0'] - vl[t[1]-'0'] < 1) continue;
            if(vr[t[2]-'0'] - vl[t[2]-'0'] < 1) continue;
            
            vector<int> v(3);
            v[2] = id[t[2]-'0'][vr[t[2]-'0']-1];
            v[1] = id[t[1]-'0'][vr[t[1]-'0']-1-(t[1] == t[2])];
            v[0] = id[t[0]-'0'][vr[t[0]-'0']-1-(t[0] == t[1])-(t[0] == t[2])];
            rep(i, 3) v[i] = r-1-v[i];
            int res = v[0] + v[1] + v[2] - 3;
            if(v[0] < v[1]) res++;
            if(v[0] < v[2]) res++;
            if(v[1] < v[2]) res++;
            chmin(ans, res);
        }
        cout << (ans < INF ? ans : -1) << '\n';
    }
    return 0;
}
0