結果
| 問題 |
No.3244 Range Multiple of 8 Query
|
| ユーザー |
 sgfc
|
| 提出日時 | 2025-08-22 23:08:47 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3,948 ms / 5,000 ms |
| コード長 | 6,020 bytes |
| コンパイル時間 | 10,248 ms |
| コンパイル使用メモリ | 543,024 KB |
| 実行使用メモリ | 172,404 KB |
| 最終ジャッジ日時 | 2025-08-22 23:10:45 |
| 合計ジャッジ時間 | 76,594 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 40 |
ソースコード
#pragma GCC optimize("O3")
#include "bits/stdc++.h"
#include <stdio.h>
#include "atcoder/all"
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;
const double eps = 1e-9;
#define OVERLOAD3(_1, _2, _3, call,...) call
#define REP0(n) for (ll i = 0; i < ll(n); ++i)
#define REP1(i, n) for (ll i = 0; i < ll(n); ++i)
#define REP2(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1, REP0)(__VA_ARGS__)
#define RREP0(n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP1(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define RREP2(i, a, b) for (ll i = ll(a) - 1; i >= b; --i)
#define RREP(...) OVERLOAD3(__VA_ARGS__, RREP2, RREP1, RREP0)(__VA_ARGS__)
#define REPE(i, c) for (auto&& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)
template<class... T> void COMMON_IN(T&... a) { (cin >> ... >> a); }
#define LI(...) ll __VA_ARGS__; COMMON_IN(__VA_ARGS__);
#define SI(...) string __VA_ARGS__; COMMON_IN(__VA_ARGS__);
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m) vector<vector<ll>> a(n, vector<ll>(m)); for(auto& x : a) for(auto& y : x) cin >> y;
using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>; using vvpl = vector<vpl>;
struct uv { ll u; ll v; };
struct uvc { ll u; ll v; ll c = 1; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uvc> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].emplace_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v); ret[x.v].emplace_back(x.u); } return ret; }
vvpl to_edge_d(const ll n, const vector<uvc>& v) { vvpl ret(n); for (auto& x : v) { ret[x.u].emplace_back(x.v, x.c); ret[x.v].emplace_back(x.u, x.c); } return ret; }
template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;
template <class T> requires std::is_base_of_v<atcoder::internal::modint_base, T> ostream& operator<<(ostream& os, const T& v) { os << v.val(); return os; }
void yn(bool f) { std::cout << (f ? "Yes" : "No") << "\n"; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<class T> void ovn(const T& v) { ov(v); cout << "\n"; };
const ll llhuge = 1LL << 61; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
void sort(auto& v) { std::ranges::sort(v); };
void rev(auto& v) { std::ranges::reverse(v); };
template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
vl tg;
for (ll v = 0; v < 1000; v += 8) {
vl vx = { v % 10, (v / 10) % 10, (v / 100) };
if(vx[0] != 0 && vx[1] != 0 && vx[2] != 0) {
tg.push_back(v);
}
}
LI(n, q);
SI(s);
vvvl pv(n, vvl(10, vl(3, -1)));
REP(i, n) {
if (i != 0) pv[i] = pv[i - 1];
ll x = s[i] - '0';
RREP(j, 2) pv[i][x][j + 1] = pv[i][x][j];
pv[i][x][0] = i;
}
REP(i, q) {
LI(l, r);
l--, r--;
ll len = r - l + 1;
if (len == 1) {
ll x = s[l] - '0';
if (x % 8 == 0) {
cout << "0\n";
} else {
cout << "-1\n";
}
}
else if (len == 2) {
ll x = (s[l] - '0') * 10 + (s[r] - '0');
ll x2 = (s[r] - '0') * 10 + (s[l] - '0');
if (x % 8 == 0) {
cout << "0\n";
}
else if (x2 % 8 == 0) {
cout << "1\n";
}
else {
cout << "-1\n";
}
}
//else if (len == 3) {
// ll x00 = (s[l] - '0') * 100 + (s[l+1] - '0') * 10 + (s[r] - '0');
// ll x10 = (s[l+1] - '0') * 100 + (s[l] - '0') * 10 + (s[r] - '0');
// ll x11 = (s[l] - '0') * 100 + (s[r] - '0') * 10 + (s[l+1] - '0');
// ll x20 = (s[l+1] - '0') * 100 + (s[r] - '0') * 10 + (s[l] - '0');
// ll x21 = (s[r] - '0') * 100 + (s[l] - '0') * 10 + (s[l+1] - '0');
// ll x30 = (s[r] - '0') * 100 + (s[l+1] - '0') * 10 + (s[l] - '0');
// if (x00 % 8 == 0) {
// cout << "0\n";
// }
// else if (x10 % 8 == 0 || x11 % 8 == 0) {
// cout << "1\n";
// }
// else if (x20 % 8 == 0 || x21 % 8 == 0) {
// cout << "2\n";
// }
// else if (x30 % 8 == 0) {
// cout << "3\n";
// }
// else {
// cout << "-1\n";
// }
//}
else {
ll ans = llhuge;
for (ll v : tg) {
vl vx = { v % 10, (v / 10) % 10, (v / 100) };
vl use(10, 0);
ll tans = 0;
vl ptv;
REP(x, 3) {
ll t = pv[r][vx[x]][use[vx[x]]];
use[vx[x]]++;
if (t < l) {
tans = llhuge; break;
}
ptv.push_back(t);
ll ot = t;
REPE(e, ptv) {
if (e < ot) t--;
}
tans += r - t - x;
}
chmin(ans, tans);
}
if (ans == llhuge) {
cout << "-1\n";
} else {
cout << ans << "\n";
}
}
}
}