結果

問題 No.3244 Range Multiple of 8 Query
コンテスト
ユーザー lif4635
提出日時 2025-08-22 23:00:20
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 3,672 bytes
コンパイル時間 422 ms
コンパイル使用メモリ 82,424 KB
実行使用メモリ 127,012 KB
最終ジャッジ日時 2025-08-22 23:00:49
合計ジャッジ時間 18,698 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 19 TLE * 1 -- * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


f = [set() for i in range(4)]
for x in range(8, 1000, 8):
    if "0" in str(x):
        continue
    f[len(str(x))].add(x)



n, q = MI()
s = list(map(int, SI()))

num = [[] for i in range(10)]

for i in range(n):
    num[s[i]].append(i)

def check(l, r, x):
    # if x != 184: return inf
    p = DD(lambda : r)
    rr = []
    res = -6
    # print(x)
    for i in reversed(str(x)):
        # print(s[l:r], x, res)
        u = int(i)
        idx = BSL(num[u], p[u]) # s 文字目をここに持ってくる
        
        # print(u, idx)
        if idx == 0:
            return inf
        b = num[u][idx-1] # ここの一にある 
        if b < l:
            return inf
        rr.append(b)
        p[u] = b
        f = 0
        for ss in rr:
            if ss < b:
                f -= 1
        b += f
        # b -> rまでいどうさせうｒ
        res += r - b
    
    return res

for i in range(q):
    l, r = MI()
    l -= 1
    d = r - l
    if d == 1:
        if s[l] == 8:
            print(0)
        else:
            print(-1)
        continue
    if d == 2:
        p = s[l]*10 +  s[l+1]
        q = s[l+1]*10 + s[l]
        if p in f[2]:
            print(0)
        elif q in f[2]:
            print(1)
        else:
            print(-1)
        continue
    
    # それ以上のときは？
    
    ans = inf
    for x in f[3]:
        ans = min(check(l, r, x), ans)
    if ans == inf:
        print(-1)
    else:
        print(ans)
0