Submission #70231458

---

Source Code Expand

import sys
# sys.setrecursionlimit(10 ** 6)

# import numpy as np
# <nonumba> from numba import njit, jit, boolean, int64, float64, typeof




def main():
    from io import StringIO
    execute(StringIO(sample), sys.stderr)
    print("-- ^sample! --", file=sys.stderr)

    execute(sys.stdin, sys.stdout)

    # #<nonumba> if len(solve.nopython_signatures) != 1:
    # #<nonumba>     raise KeyboardInterrupt("!! Unexpected: wrong use of jit !!")

def execute(src, dst):

    N, K, = map(int, src.readline().split())
    S = src.readline().strip()

    x, ts = solve(N, K, S)
    print(x, file=dst)
    print(*ts,  file=dst)

sample = """\
9 3
ovowowovo
"""

# #<nonumba> @jit(nopython=True, cache=True)
def solve(N, K, S):

    x_now = 0
    ts = []
    for ii in range(N):
        t = S[ii : ii + K]
        if len(t) != K :
            continue

        x_t = 1  # 出現回数は１から
        for offset in range(1, N):
            jj = ii + offset
            u = S[jj : jj+K]
            if len(u) != K :
                continue
            if t == u :
                x_t += 1
        if x_now < x_t:
            x_now = x_t
            ts.clear()
        if x_now == x_t :
            ts.append(t)
    ts.sort()

    return x_now , ts




main()

Submission Info

Judge Result