結果

問題 No.3290 Encrypt Failed, but Decrypt Succeeded
ユーザー lif4635
提出日時 2025-10-03 21:29:41
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 177 ms / 2,000 ms
コード長 2,093 bytes
コンパイル時間 426 ms
コンパイル使用メモリ 82,552 KB
実行使用メモリ 112,876 KB
最終ジャッジ日時 2025-10-03 21:29:47
合計ジャッジ時間 5,297 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff #

# input
import sys
input = sys.stdin.readline
II = lambda : int(input())
MI = lambda : map(int, input().split())
LI = lambda : [int(a) for a in input().split()]
SI = lambda : input().rstrip()
LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)]
LSI = lambda n : [input().rstrip() for _ in range(n)]
MI_1 = lambda : map(lambda x:int(x)-1, input().split())
LI_1 = lambda : [int(a)-1 for a in input().split()]

mod = 998244353
inf = 1001001001001001001
ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97
ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97
yes = lambda : print("Yes")
no = lambda : print("No")
yn = lambda flag : print("Yes" if flag else "No")

prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1)
alplow = "abcdefghijklmnopqrstuvwxyz"
alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]]
prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59]
sys.set_int_max_str_digits(0)
# sys.setrecursionlimit(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')

from collections import defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
DD = defaultdict
BSL = bisect_left
BSR = bisect_right


n, k = MI()
t = SI()

dp = [0] * (n + 1)
dp[n] = 1
for i in reversed(range(n)):
    if 1 <= int(t[i]) <= 9: 
        dp[i] += dp[i+1]
    if i != n - 1 and 10 <= int(t[i:i+2]) <= 26:
        dp[i] += dp[i+2]
    if dp[i] > inf:
        dp[i] = inf

ans = []
i = 0
while i < n:
    if 1 <= int(t[i]) <= 9: 
        if k <= dp[i+1]:
            ans.append(alplow[int(t[i]) - 1])
            i += 1
            continue
        else:
            k -= dp[i+1]
    
    if i != n - 1 and 10 <= int(t[i:i+2]) <= 26:
        ans.append(alplow[int(t[i:i+2]) - 1])
        i += 2
    # 
    # print(k, i)

# print(dp)
print(*ans, sep = "")
0