結果

問題 No.1471 Sort Queries
ユーザー cozy_saunacozy_sauna
提出日時 2022-03-09 16:03:19
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 239 ms / 2,000 ms
コード長 3,110 bytes
コンパイル時間 368 ms
コンパイル使用メモリ 87,184 KB
実行使用メモリ 86,252 KB
最終ジャッジ日時 2023-10-11 16:56:05
合計ジャッジ時間 10,954 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 147 ms
79,364 KB
testcase_01 AC 143 ms
79,268 KB
testcase_02 AC 144 ms
79,420 KB
testcase_03 AC 157 ms
80,756 KB
testcase_04 AC 149 ms
80,156 KB
testcase_05 AC 147 ms
80,288 KB
testcase_06 AC 143 ms
79,396 KB
testcase_07 AC 148 ms
80,584 KB
testcase_08 AC 160 ms
81,120 KB
testcase_09 AC 151 ms
80,492 KB
testcase_10 AC 152 ms
79,264 KB
testcase_11 AC 151 ms
80,472 KB
testcase_12 AC 158 ms
80,912 KB
testcase_13 AC 216 ms
84,012 KB
testcase_14 AC 201 ms
83,632 KB
testcase_15 AC 213 ms
83,860 KB
testcase_16 AC 192 ms
82,660 KB
testcase_17 AC 202 ms
83,256 KB
testcase_18 AC 203 ms
83,280 KB
testcase_19 AC 194 ms
82,676 KB
testcase_20 AC 206 ms
83,948 KB
testcase_21 AC 204 ms
83,332 KB
testcase_22 AC 203 ms
83,140 KB
testcase_23 AC 228 ms
85,208 KB
testcase_24 AC 227 ms
85,052 KB
testcase_25 AC 230 ms
85,184 KB
testcase_26 AC 223 ms
84,648 KB
testcase_27 AC 238 ms
86,132 KB
testcase_28 AC 233 ms
86,180 KB
testcase_29 AC 220 ms
84,484 KB
testcase_30 AC 219 ms
84,760 KB
testcase_31 AC 232 ms
84,928 KB
testcase_32 AC 220 ms
84,752 KB
testcase_33 AC 235 ms
86,036 KB
testcase_34 AC 237 ms
86,036 KB
testcase_35 AC 239 ms
86,032 KB
testcase_36 AC 233 ms
85,968 KB
testcase_37 AC 233 ms
86,244 KB
testcase_38 AC 231 ms
86,252 KB
testcase_39 AC 229 ms
86,016 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from sys import setrecursionlimit, stdin
from collections import defaultdict, deque
from itertools import permutations, combinations, product
from functools import lru_cache
from random import sample, choice, randint, random
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop
from math import factorial, exp
from copy import copy, deepcopy
from time import time

setrecursionlimit(1 << 20)
readline = stdin.readline
# @lru_cache(maxsize = None)
INF = 10 ** 18
MOD = 998244353
# MOD = 1000000007
DYDX = [(-1, 0), (1, 0), (0, -1), (0, 1)]
''' Input '''
def I(): return int(readline())
def ST(): return readline()[:-1]
def LI(): return list(map(int, readline().split()))
def LII(): return list(map(lambda x: int(x)-1, readline().split()))
def SPI(): return map(int, readline().split())
def SPII(): return map(lambda x: int(x)-1, readline().split())
def FIE(x): return [readline()[:-1] for _ in [0] * x]
def NODE(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b = SPII()
        node[a].append(b)
        node[b].append(a)
    return node 

def NODE_W(N, edge):
    node = [[] for _ in [0] * N]
    for _ in [0] * edge:
        a, b, c = SPI()
        a -= 1
        b -= 1
        node[a].append((b, c))
        node[b].append((a, c))
    return node

''' Array '''
def cmin(dp, i, x):
    if x < dp[i]: dp[i] = x
def cmax(dp, i, x):
    if x > dp[i]: dp[i] = x

''' Sorted Array '''
# x <= A[i] (minimum i meeting the requirement)
def binary(sortedA, x): return bisect_left(sortedA, x)
# x < A[i] (minimum i meeting the requirement)
def binary2(sortedA, x): return bisect_right(sortedA, x + 1)
# number of x in A
def quantity(sortedA, x): return bisect_right(sortedA, x) - bisect_left(sortedA, x)

''' Other'''
def ranges(*args): return [(i, j) for i in range(args[0]) for j in range(args[-1])]
def nynx(y, x, ly = INF, lx = INF): return [(y + dy, x + dx) for dy, dx in DYDX if 0 <= y + dy < ly and 0 <= x + dx < lx]
def gen(x, *args):
    ret = [x] * args[-1]
    for e in args[:-1][::-1]: ret = [deepcopy(ret) for _ in [0] * e]
    return ret
def is_prime(x):
    if x == 1 or x % 2 == 0: return x == 2
    f = 3
    while f * f <= x:
        if x % f == 0: return False 
        f += 2
    return True 

''' Output '''
def puts(E):
    for e in E: print(e)
def pprint(E): 
    print()
    for e in E: print(e)
def yn(x): print("Yes" if x else "No")
def blank(arr): print(" ".join(map(str, arr)))
def debug(*args):
    if DEBUG:
        for e in args: print(e)
DEBUG = False
###############################################################################################

N, Q = SPI()
S = ST()
A = gen(0, N + 1, 26)
for i in range(N):
    for j in range(26):
        A[i+1][j] += A[i][j]
    idx = ord(S[i]) - ord('a')    
    A[i+1][idx] += 1

for _ in range(Q):
    L, R, X = SPI()
    now = gen(0, 26)
    for i in range(26):
        now[i] += A[R][i]
    for i in range(26):
        now[i] -= A[L-1][i]

    total = 0
    for i in range(26):
        total += now[i]
        if X <= total:
            print(chr(ord('a') + i))
            break
0