結果

問題 No.1018 suffixsuffixsuffix
ユーザー Kiri8128Kiri8128
提出日時 2020-04-03 23:24:20
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,631 bytes
コンパイル時間 282 ms
コンパイル使用メモリ 87,332 KB
実行使用メモリ 130,536 KB
最終ジャッジ日時 2023-09-16 04:56:39
合計ジャッジ時間 11,623 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 76 ms
71,360 KB
testcase_01 AC 72 ms
71,404 KB
testcase_02 AC 74 ms
71,552 KB
testcase_03 AC 73 ms
71,320 KB
testcase_04 AC 74 ms
71,352 KB
testcase_05 AC 77 ms
71,400 KB
testcase_06 AC 75 ms
71,392 KB
testcase_07 AC 75 ms
71,488 KB
testcase_08 AC 73 ms
71,528 KB
testcase_09 AC 188 ms
90,048 KB
testcase_10 AC 192 ms
90,912 KB
testcase_11 AC 202 ms
92,900 KB
testcase_12 AC 190 ms
92,584 KB
testcase_13 AC 191 ms
91,768 KB
testcase_14 WA -
testcase_15 AC 375 ms
117,300 KB
testcase_16 AC 384 ms
122,364 KB
testcase_17 AC 366 ms
117,484 KB
testcase_18 WA -
testcase_19 AC 155 ms
85,696 KB
testcase_20 AC 147 ms
86,156 KB
testcase_21 AC 150 ms
86,304 KB
testcase_22 AC 156 ms
86,048 KB
testcase_23 AC 153 ms
86,884 KB
testcase_24 AC 376 ms
126,892 KB
testcase_25 AC 396 ms
129,524 KB
testcase_26 AC 366 ms
120,616 KB
testcase_27 AC 381 ms
125,976 KB
testcase_28 AC 369 ms
121,132 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 AC 397 ms
130,536 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

from bisect import bisect_left as bl
from bisect import bisect_right as br

def SA_IS(a):
    a += [0]
    k = max(a) + 1
    n = len(a)
    
    def induce_l(sa, a, n, k, stype):
        bucket = get_buckets(a, k, 1)
        for i in range(n):
            j = sa[i] - 1
            if j >= 0 and (not stype[j]):
                sa[bucket[a[j]]] = j
                bucket[a[j]] += 1
    
    def induce_s(sa, a, n, k, stype):
        bucket = get_buckets(a, k, 0)
        for i in range(n)[::-1]:
            j = sa[i] - 1
            if j >= 0 and stype[j]:
                bucket[a[j]] -= 1
                sa[bucket[a[j]]] = j
    
    def get_buckets(a, k, start = 0):
        bucket = [0] * k
        for item in a:
            bucket[item] += 1
        s = 0
        for i in range(k):
            s += bucket[i]
            bucket[i] = s - (bucket[i] if start else 0)
        return bucket
    
    def set_lms(a, n, k, default_order):
        bucket = get_buckets(a, k)
        sa = [-1] * n
        for i in default_order[::-1]:
            bucket[a[i]] -= 1
            sa[bucket[a[i]]] = i
        return sa
    
    def induce(a, n, k, stype, default_order):
        sa = set_lms(a, n, k, default_order)
        induce_l(sa, a, n, k, stype)
        induce_s(sa, a, n, k, stype)
        return sa
    
    def rename_LMS_substring(sa, a, n, stype, LMS, l):
        sa = [_s for _s in sa if LMS[_s]]
        tmp = [-1] * (n//2) + [0]
        dupl = 0
        for _ in range(1, l):
            i, j = sa[_-1], sa[_]
            for ii in range(n):
                if a[i+ii] != a[j+ii] or stype[i+ii] != stype[j+ii]:
                    break
                if ii and (LMS[i+ii] or LMS[j+ii]):
                    dupl += 1
                    break
            tmp[j//2] = _ - dupl
        tmp = [t for t in tmp if t >= 0]
        return tmp, dupl
    
    def calc(a, n, k):
        stype = [1] * n
        for i in range(n-1)[::-1]:
            if a[i] > a[i+1] or (a[i] == a[i+1] and stype[i+1] == 0):
                stype[i] = 0
        
        LMS = [1 if stype[i] and not stype[i-1] else 0 for i in range(n-1)] + [1]
        l = sum(LMS)
        lms = [i for i in range(n) if LMS[i]]
        sa = induce(a, n, k, stype, lms)
        renamed_LMS, dupl = rename_LMS_substring(sa, a, n, stype, LMS, l)
        
        if dupl:
            sub_sa = calc(renamed_LMS, l, l - dupl)
        else:
            sub_sa = [0] * l
            for i in range(l):
                sub_sa[renamed_LMS[i]] = i
        
        lms = [lms[sub_sa[i]] for i in range(l)]
        sa = induce(a, n, k, stype, lms)
        return sa
    
    sa = calc(a, n, k)
    return sa


N, M, Q = map(int, input().split())
S = [ord(a)-96 for a in input()]
K = [int(a)-1 for a in input().split()]

if S.count(S[0]) == N:
    print(*[N * M + 1 - k for k in K])
elif M <= 2:
    S *= M
    SA = SA_IS(S)[1:]
    print(*[s + 1 for s in SA])
else:
    S *= 2
    SA = SA_IS(S)[1:]

    X = []
    i = 0
    for s in SA:
        if s >= N:
            # X.append((i, (M-1) * N + (s - N)))
            X.append((i << 47) + (M-1) * N + (s - N) + 1)
            i += 1
        else:
            # X.append((i, s))
            X.append((i << 47) + (M-2) * N + s + 1)
            i += M-1
    
    def chk(a):
        return (a >> 47, a - (a >> 47 << 47) - 1)
    
    # print("X =", [chk(x) for x in X])
    X = sorted(X)
    # print("SA =", SA)
    # print("X =", X)
    # print("X =", [chk(x) for x in X])
    def calc(k):
        t = bl(X, k + 1 << 47) - 1
        a, b = chk(X[t])
        return b - (k - a) * N + 1
    print(*[calc(k) for k in K])
0