結果

問題 No.3188 K-th Lexmin
コンテスト
ユーザー 蜜蜂
提出日時 2025-06-13 16:51:22
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,838 ms / 3,500 ms
コード長 4,440 bytes
コンパイル時間 439 ms
コンパイル使用メモリ 82,216 KB
実行使用メモリ 180,440 KB
最終ジャッジ日時 2025-08-15 19:39:19
合計ジャッジ時間 71,911 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 47
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = sys.stdin.buffer.readline

# https://github.com/shakayami/ACL-for-python
class string:
    def sa_is(s,upper):
        n=len(s)
        if n==0:
            return []
        if n==1:
            return [0]
        if n==2:
            if (s[0]<s[1]):
                return [0,1]
            else:
                return [1,0]
        sa=[0]*n
        ls=[0]*n
        for i in range(n-2,-1,-1):
            ls[i]=ls[i+1] if (s[i]==s[i+1]) else (s[i]<s[i+1])
        sum_l=[0]*(upper+1)
        sum_s=[0]*(upper+1)
        for i in range(n):
            if not(ls[i]):
                sum_s[s[i]]+=1
            else:
                sum_l[s[i]+1]+=1
        for i in range(upper+1):
            sum_s[i]+=sum_l[i]
            if i<upper:
                sum_l[i+1]+=sum_s[i]
        def induce(lms):
            for i in range(n):
                sa[i]=-1
            buf=sum_s[:]
            for d in lms:
                if d==n:
                    continue
                sa[buf[s[d]]]=d
                buf[s[d]]+=1
            buf=sum_l[:]
            sa[buf[s[n-1]]]=n-1
            buf[s[n-1]]+=1
            for i in range(n):
                v=sa[i]
                if v>=1 and not(ls[v-1]):
                    sa[buf[s[v-1]]]=v-1
                    buf[s[v-1]]+=1
            buf=sum_l[:]
            for i in range(n-1,-1,-1):
                v=sa[i]
                if v>=1 and ls[v-1]:
                    buf[s[v-1]+1]-=1
                    sa[buf[s[v-1]+1]]=v-1
        lms_map=[-1]*(n+1)
        m=0
        for i in range(1,n):
            if not(ls[i-1]) and ls[i]:
                lms_map[i]=m
                m+=1
        lms=[]
        for i in range(1,n):
            if not(ls[i-1]) and ls[i]:
                lms.append(i)
        induce(lms)
        if m:
            sorted_lms=[]
            for v in sa:
                if lms_map[v]!=-1:
                    sorted_lms.append(v)
            rec_s=[0]*m
            rec_upper=0
            rec_s[lms_map[sorted_lms[0]]]=0
            for i in range(1,m):
                l=sorted_lms[i-1]
                r=sorted_lms[i]
                end_l=lms[lms_map[l]+1] if (lms_map[l]+1<m) else n
                end_r=lms[lms_map[r]+1] if (lms_map[r]+1<m) else n
                same=True
                if end_l-l!=end_r-r:
                    same=False
                else:
                    while(l<end_l):
                        if s[l]!=s[r]:
                            break
                        l+=1
                        r+=1
                    if (l==n) or (s[l]!=s[r]):
                        same=False
                if not(same):
                    rec_upper+=1
                rec_s[lms_map[sorted_lms[i]]]=rec_upper
            rec_sa=string.sa_is(rec_s,rec_upper)
            for i in range(m):
                sorted_lms[i]=lms[rec_sa[i]]
            induce(sorted_lms)
        return sa
    def suffix_array(s):
        n=len(s)
        if type(s)==str:
            s2=[ord(i) for i in s]
            return string.sa_is(s2,255)
        else:
            idx=list(range(n))
            idx.sort(key=lambda x:s[x])
            s2=[0]*n
            now=0
            for i in range(n):
                if (i > 0 and s[idx[i-1]]!=s[idx[i]]):
                    now+=1
                s2[idx[i]]=now
            return string.sa_is(s2,now)

def solve():
  n, k = map(int, input().split())
  a = list(map(int, input().split()))
  for i in range(n):
    a[i] -= 1
  sa = string.suffix_array(a)
  len = [n - sa[i] for i in range(n)]
  lensum = [0] * (n + 1)
  for i in range(n):
    lensum[i + 1] = lensum[i] + len[i]
  l, r = 0, n - 1
  rem = k
  ans = []
  for i in range(n):
    def rng(val):
      ok, ng = l - 1, r + 1
      while ng - ok > 1:
        check = (ok + ng) // 2
        if sa[check] + i >= n or a[sa[check] + i] <= val:
          ok = check
        else:
          ng = check
      return ok
    def num(val):
      right = rng(val)
      res = lensum[right + 1] - lensum[l] - (right - l + 1) * i
      return res
    ok, ng = -1, n + 1
    while ng - ok > 1:
      check = (ok + ng) // 2
      if num(check) < rem:
        ok = check
      else:
        ng = check
    ans.append(ng + 1)
    rem -= num(ok)
    left = rng(ok) + 1
    right = rng(ng)
    l, r = left, right
    rem -= r - l + 1
    if rem <= 0:
      break
  print(*ans, sep = " ")
  

t = int(input())
for i in range(t):
  solve()
0