結果
問題 | No.1471 Sort Queries |
ユーザー | McGregorsh |
提出日時 | 2022-07-19 18:51:01 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 289 ms / 2,000 ms |
コード長 | 1,865 bytes |
コンパイル時間 | 269 ms |
コンパイル使用メモリ | 87,028 KB |
実行使用メモリ | 96,176 KB |
最終ジャッジ日時 | 2023-09-14 15:06:34 |
合計ジャッジ時間 | 12,942 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 233 ms
92,284 KB |
testcase_01 | AC | 232 ms
92,440 KB |
testcase_02 | AC | 239 ms
92,288 KB |
testcase_03 | AC | 240 ms
92,616 KB |
testcase_04 | AC | 236 ms
92,476 KB |
testcase_05 | AC | 239 ms
92,272 KB |
testcase_06 | AC | 237 ms
92,256 KB |
testcase_07 | AC | 236 ms
92,444 KB |
testcase_08 | AC | 236 ms
92,724 KB |
testcase_09 | AC | 233 ms
92,576 KB |
testcase_10 | AC | 229 ms
92,352 KB |
testcase_11 | AC | 234 ms
92,252 KB |
testcase_12 | AC | 232 ms
93,164 KB |
testcase_13 | AC | 256 ms
93,936 KB |
testcase_14 | AC | 254 ms
93,824 KB |
testcase_15 | AC | 260 ms
94,596 KB |
testcase_16 | AC | 258 ms
94,636 KB |
testcase_17 | AC | 254 ms
93,872 KB |
testcase_18 | AC | 252 ms
94,148 KB |
testcase_19 | AC | 262 ms
93,940 KB |
testcase_20 | AC | 270 ms
94,524 KB |
testcase_21 | AC | 258 ms
95,268 KB |
testcase_22 | AC | 256 ms
94,116 KB |
testcase_23 | AC | 277 ms
95,544 KB |
testcase_24 | AC | 279 ms
95,544 KB |
testcase_25 | AC | 283 ms
95,716 KB |
testcase_26 | AC | 281 ms
94,904 KB |
testcase_27 | AC | 281 ms
95,992 KB |
testcase_28 | AC | 288 ms
96,056 KB |
testcase_29 | AC | 283 ms
94,964 KB |
testcase_30 | AC | 272 ms
95,320 KB |
testcase_31 | AC | 287 ms
95,508 KB |
testcase_32 | AC | 288 ms
94,860 KB |
testcase_33 | AC | 288 ms
95,912 KB |
testcase_34 | AC | 288 ms
96,176 KB |
testcase_35 | AC | 286 ms
95,916 KB |
testcase_36 | AC | 286 ms
95,820 KB |
testcase_37 | AC | 282 ms
96,028 KB |
testcase_38 | AC | 289 ms
95,988 KB |
testcase_39 | AC | 276 ms
95,892 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): n, q = i_map() s = input() counts = [[0] * (n+1) for i in range(26)] for i in range(n): point = ord(s[i]) - 97 counts[point][i+1] += 1 for i in range(26): for j in range(n): counts[i][j+1] += counts[i][j] #print(counts) for i in range(q): l, r, x = i_map() cou = 0 for j in range(26): score = counts[j][r] - counts[j][l-1] cou += score if cou >= x: print(chr(j + 97)) break if __name__ == '__main__': main()