結果

問題 No.3244 Range Multiple of 8 Query
ユーザー noya2
提出日時 2025-08-22 23:02:59
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 695 ms / 5,000 ms
コード長 6,566 bytes
コンパイル時間 3,690 ms
コンパイル使用メモリ 287,692 KB
実行使用メモリ 15,792 KB
最終ジャッジ日時 2025-08-22 23:03:17
合計ジャッジ時間 16,062 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


void solve(){
    int n, q; in(n,q);
    vector<int> a(n);
    {
        string s; in(s);
        rep(i,n){
            a[i] = int(s[i] - '0');
        }
    }
    using ar = array<int,10>;
    vector<ar> pre(n+1);
    fill(all(pre[0]),-1);
    rep(i,n){
        pre[i+1] = pre[i];
        pre[i+1][a[i]] = i;
    }
    vector<array<int,3>> mul8;
    for (int x = 0; x < 1000; x += 8){
        array<int,3> dig = {};
        int y = x;
        bool z = false;
        rep(tt,3){
            dig[tt] = y % 10;
            if (y % 10 == 0){
                z = true;
            }
            y /= 10;
        }
        if (!z){
            mul8.emplace_back(dig);
        }
    }
    array<int,3> reg;
    auto cost = [&](int r) -> int {
        // reg[0] -- r-1
        // reg[1] -- r-2
        // reg[2] -- r-3
        int ans = 0;
        ans += r-1 - reg[0];
        if (reg[1] > reg[0]) reg[1]--;
        if (reg[2] > reg[0]) reg[2]--;
        ans += r-2 - reg[1];
        if (reg[2] > reg[1]) reg[2]--;
        ans += r-3 - reg[2];
        return ans;
    };
    auto calc = [&](int l, int r){
        if (r - l == 1){
            if (a[l] % 8 == 0){
                return 0;
            }
            return -1;
        }
        if (r - l == 2){
            if ((a[l] * 10 + a[l+1]) % 8 == 0){
                return 0;
            }
            if ((a[l+1] * 10 + a[l]) % 8 == 0){
                return 1;
            }
            return -1;
        }
        int ans = iinf;
        array<int,10> posini;
        fill(all(posini),r);
        for (auto dig : mul8){
            bool fail = false;
            auto pos = posini;
            rep(t,3){
                int d = dig[t];
                int npos = pre[pos[d]][d];
                if (npos < l){
                    fail = true;
                    break;
                }
                reg[t] = npos;
                pos[d] = npos;
            }
            if (fail) continue;
            chmin(ans,cost(r));
        }
        if (ans == iinf){
            return -1;
        }
        return ans;
    };
    while (q--){
        int l, r; in(l,r); l--;
        int ans = calc(l,r);
        out(ans);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0