結果
問題 | No.1471 Sort Queries |
ユーザー | McGregorsh |
提出日時 | 2022-07-19 18:27:55 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,555 bytes |
コンパイル時間 | 286 ms |
コンパイル使用メモリ | 87,200 KB |
実行使用メモリ | 95,704 KB |
最終ジャッジ日時 | 2023-09-14 14:34:50 |
合計ジャッジ時間 | 34,671 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 238 ms
92,212 KB |
testcase_01 | AC | 230 ms
92,336 KB |
testcase_02 | AC | 234 ms
92,460 KB |
testcase_03 | AC | 233 ms
92,432 KB |
testcase_04 | AC | 229 ms
92,328 KB |
testcase_05 | AC | 224 ms
92,468 KB |
testcase_06 | AC | 232 ms
92,408 KB |
testcase_07 | AC | 231 ms
92,196 KB |
testcase_08 | AC | 232 ms
92,328 KB |
testcase_09 | AC | 227 ms
92,396 KB |
testcase_10 | AC | 237 ms
92,544 KB |
testcase_11 | AC | 232 ms
92,332 KB |
testcase_12 | AC | 237 ms
92,284 KB |
testcase_13 | AC | 646 ms
95,052 KB |
testcase_14 | AC | 571 ms
93,988 KB |
testcase_15 | AC | 870 ms
93,964 KB |
testcase_16 | AC | 362 ms
94,372 KB |
testcase_17 | AC | 525 ms
94,304 KB |
testcase_18 | AC | 437 ms
93,960 KB |
testcase_19 | AC | 401 ms
94,064 KB |
testcase_20 | AC | 861 ms
93,996 KB |
testcase_21 | AC | 535 ms
93,924 KB |
testcase_22 | AC | 486 ms
93,980 KB |
testcase_23 | AC | 1,657 ms
94,404 KB |
testcase_24 | AC | 1,651 ms
94,328 KB |
testcase_25 | TLE | - |
testcase_26 | AC | 1,445 ms
94,392 KB |
testcase_27 | TLE | - |
testcase_28 | TLE | - |
testcase_29 | AC | 1,461 ms
94,084 KB |
testcase_30 | AC | 1,578 ms
94,532 KB |
testcase_31 | TLE | - |
testcase_32 | TLE | - |
testcase_33 | TLE | - |
testcase_34 | -- | - |
testcase_35 | -- | - |
testcase_36 | -- | - |
testcase_37 | -- | - |
testcase_38 | -- | - |
testcase_39 | -- | - |
ソースコード
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 = list(input()) for i in range(q): l, r, x = i_map() l -= 1 r -= 1 x -= 1 new = s[l:r+1] new.sort() print(new[x]) if __name__ == '__main__': main()