Submission #70220171

Source Code Expand

from collections import *

N, K = map(int, input().split())
S = input()
D = defaultdict(int)
for i in range(N - K + 1):
    D[S[i:i+K]] += 1

ans = -1
for k, v in D.items():
    ans = max(ans, v)

L = []
for k, v in D.items():
    if ans == v:
        L.append(k)

L.sort()
print(ans)
print(*L)

Submission Info

Submission Time
Task B - Most Frequent Substrings
User rlangevin
Language Python (PyPy 3.10-v7.3.12)
Score 200
Code Size 313 Byte
Status AC
Exec Time 71 ms
Memory 77144 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 22
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 68 ms 76992 KiB
00-sample-02.txt AC 68 ms 76712 KiB
00-sample-03.txt AC 69 ms 77040 KiB
01-01.txt AC 69 ms 76832 KiB
01-02.txt AC 69 ms 76988 KiB
01-03.txt AC 69 ms 76800 KiB
01-04.txt AC 70 ms 77056 KiB
01-05.txt AC 70 ms 77056 KiB
01-06.txt AC 70 ms 76788 KiB
01-07.txt AC 70 ms 76968 KiB
01-08.txt AC 69 ms 77144 KiB
01-09.txt AC 69 ms 76976 KiB
01-10.txt AC 70 ms 76948 KiB
01-11.txt AC 71 ms 76988 KiB
01-12.txt AC 69 ms 76608 KiB
01-13.txt AC 70 ms 76772 KiB
01-14.txt AC 69 ms 77076 KiB
01-15.txt AC 70 ms 76932 KiB
01-16.txt AC 69 ms 76632 KiB
01-17.txt AC 70 ms 76692 KiB
01-18.txt AC 70 ms 76944 KiB
01-19.txt AC 70 ms 76808 KiB