結果

問題 No.3299 K-th MMA String
ユーザー lif4635
提出日時 2025-10-05 15:08:29
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 73 ms / 2,000 ms
コード長 2,529 bytes
コンパイル時間 224 ms
コンパイル使用メモリ 82,404 KB
実行使用メモリ 84,932 KB
最終ジャッジ日時 2025-10-05 15:08:42
合計ジャッジ時間 2,469 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

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

# for n in range(3, 10):
#     c = 0
#     for bit in range(1 << n):
        
#         s = []
#         for i in reversed(range(n)):
#             s += [bit >> i & 1]
#         ok = 0
#         for i in range(n-2):
#             if s[i:i+3] == [1,1,0]:
#                 ok = 1
#         if ok:
#             # print(s)
#             c += 1
#     print(n, c)

n, k = MI()
k -= 1

a = [inf] * (n + 1)
a[0] = a[1] = a[2] = 0
a[3] = 1
# はじめに 0 を選ぶと？
for i in range(4, n + 1):
    a[i] = 4 * a[i-1] - 4 * a[i-2] - a[i-3] + 2 * a[i-4]
    if a[i] >= inf:
        break

f = 0
ans = []
for i in reversed(range(1, n + 1)):
    if f == 0:
        if a[i-1] <= k:
            ans.append("M")
            k -= a[i-1]
            if len(ans) >= 2 and ans[-2] == "M":
                f = 1
        else:
            ans.append("A")
    else:
        # MM のとき
        f = 1
        t = pow(2, i-1, mod)
        if k < t:
            ans.append("A")
        else:
            k -= t
            ans.append("M")

# print(a[:10])
print(*ans, sep = "")
exit()
0