結果

問題 No.3082 Make Palindromic Multiple(Judge)
ユーザー lif4635
提出日時 2025-03-28 21:52:52
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,346 bytes
コンパイル時間 262 ms
コンパイル使用メモリ 82,276 KB
実行使用メモリ 111,000 KB
最終ジャッジ日時 2025-03-28 21:53:00
合計ジャッジ時間 7,573 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 60 WA * 6
権限があれば一括ダウンロードができます

ソースコード

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()]

def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b = map(int, input().split())
        a += index
        b += index
        edge[a].add(b)
        if not dir:
            edge[b].add(a)
    return edge

def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]:
    edge = [set() for i in range(n+1+index)]
    for _ in range(m):
        a,b,c = map(int, input().split())
        a += index
        b += index
        edge[a].add((b,c))
        if not dir:
            edge[b].add((a,c))
    return edge

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")
def acc(a:list[int]):
    sa = [0]*(len(a)+1)
    for i in range(len(a)):
        sa[i+1] = a[i] + sa[i]
    return sa

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

from math import gcd

k = II()

a = deque()
for i in range(k):
    s,t = input().split()
    t = int(t)
    a.append([s, t])

def check(s1, t1, s2, t2, last):
    l1 = len(s1)
    l2 = len(s2)
    if last:
        if l1 * t1 <= l2 and t2 == 1:
            l = l1 * t1
            if s2[:l] == s1 * t1:
                sl = s2[l:]
                if sl == sl[::-1]:
                    exit(yes())
            exit(no())
                
                
    g = gcd(l1, l2)
    s = s1[:g]
    if s1 != s*(l1//g) or s2 != s*(l2//g):
        exit(no())
    else:
        c = l2 * t2 - l1 * t1
        return (s, c)

while a:
    s1,t1 = a.popleft()
    if len(a) == 0:
        if s1 == s1[::-1]:
            exit(yes())
        else:
            exit(no())
    s2,t2 = a.pop()
    
    c1 = len(s1) * t1
    c2 = len(s2) * t2
    
    last = False
    if len(a) == 0:
        last = True
    
    if c1 <= c2:
        s,t = check(s1, t1, s2[::-1], t2, last)
        if t != 0:
            a.append((s[::-1], t))
    else:
        s,t = check(s2[::-1], t2, s1, t1, last)
        if t != 0:
            a.appendleft((s, t))
    # print(a)

yes()
0