結果
問題 | No.2388 At Least K-Characters |
ユーザー | cleantted |
提出日時 | 2023-07-22 00:12:38 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 761 ms / 4,000 ms |
コード長 | 2,117 bytes |
コンパイル時間 | 365 ms |
コンパイル使用メモリ | 87,556 KB |
実行使用メモリ | 103,236 KB |
最終ジャッジ日時 | 2023-09-18 13:04:53 |
合計ジャッジ時間 | 24,333 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 345 ms
95,520 KB |
testcase_01 | AC | 345 ms
95,792 KB |
testcase_02 | AC | 348 ms
96,372 KB |
testcase_03 | AC | 339 ms
96,092 KB |
testcase_04 | AC | 341 ms
95,972 KB |
testcase_05 | AC | 342 ms
95,972 KB |
testcase_06 | AC | 342 ms
96,140 KB |
testcase_07 | AC | 343 ms
95,652 KB |
testcase_08 | AC | 340 ms
96,040 KB |
testcase_09 | AC | 341 ms
95,652 KB |
testcase_10 | AC | 342 ms
96,136 KB |
testcase_11 | AC | 344 ms
96,004 KB |
testcase_12 | AC | 346 ms
96,076 KB |
testcase_13 | AC | 364 ms
97,308 KB |
testcase_14 | AC | 364 ms
97,512 KB |
testcase_15 | AC | 362 ms
97,548 KB |
testcase_16 | AC | 684 ms
102,784 KB |
testcase_17 | AC | 628 ms
102,836 KB |
testcase_18 | AC | 675 ms
103,168 KB |
testcase_19 | AC | 689 ms
102,988 KB |
testcase_20 | AC | 708 ms
102,940 KB |
testcase_21 | AC | 722 ms
103,144 KB |
testcase_22 | AC | 712 ms
102,580 KB |
testcase_23 | AC | 761 ms
102,588 KB |
testcase_24 | AC | 698 ms
102,748 KB |
testcase_25 | AC | 679 ms
103,236 KB |
testcase_26 | AC | 696 ms
103,172 KB |
testcase_27 | AC | 695 ms
102,896 KB |
testcase_28 | AC | 706 ms
102,932 KB |
testcase_29 | AC | 697 ms
102,680 KB |
testcase_30 | AC | 691 ms
102,740 KB |
testcase_31 | AC | 692 ms
102,608 KB |
testcase_32 | AC | 697 ms
102,776 KB |
testcase_33 | AC | 677 ms
103,128 KB |
testcase_34 | AC | 702 ms
102,576 KB |
testcase_35 | AC | 704 ms
102,744 KB |
testcase_36 | AC | 703 ms
103,204 KB |
ソースコード
# import bisect import copy import heapq import itertools import math import operator import random import sys from bisect import bisect, bisect_left, bisect_right, insort from collections import Counter, deque from fractions import Fraction from functools import cmp_to_key, lru_cache, partial from inspect import currentframe from math import ceil, gcd, log10, pi, sqrt from typing import Iterable, Iterator, List, Tuple, TypeVar, Union # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') # import string # import networkx as nx input = sys.stdin.readline sys.setrecursionlimit(10000000) # mod = 10 ** 9 + 7 mod = 998244353 # mod = 1 << 128 # mod = 10 ** 30 + 1 INF = 1 << 61 DIFF = 10 ** -9 DX = [1, 0, -1, 0, 1, 1, -1, -1] DY = [0, 1, 0, -1, 1, -1, 1, -1] def read_values(): return tuple(map(int, input().split())) def read_index(): return tuple(map(lambda x: int(x) - 1, input().split())) def read_list(): return list(read_values()) def read_lists(N): return [read_list() for _ in range(N)] def dprint(*values): print(*values, file=sys.stderr) def dprint2(*values): names = {id(v): k for k, v in currentframe().f_back.f_locals.items()} dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values)) def main(): N, M, K = read_values() S = input().strip() S = [ord(s) - ord("a") for s in S] T = set() dp = [0] * 27 res = 0 for i in range(M): dp2 = [0] * 27 if i < N: for s in range(S[i]): if s in T: dp2[len(T)] += 1 else: dp2[len(T) + 1] += 1 T.add(S[i]) if len(T) >= K: res += 1 res %= mod for d, t in enumerate(dp): dp2[d] += d * t % mod dp2[d] %= mod if d < 26: dp2[d + 1] += t * (26 - d) % mod dp2[d + 1] %= mod res += sum(dp2[K:]) % mod res %= mod dp = dp2 if len(T) >= K: res -= 1 res %= mod print(res) if __name__ == "__main__": main()