Submission #25755734


Source Code Expand

Copy
def encode(S):
i_min=10000
j_min=10000
for i in range(N):
s=S[i]
for j in range(N):
if s[j]=="#":
i_min=min(i_min,i)
j_min=min(j_min,j)
E=set()
for i in range(N):
s=S[i]
for j in range(N):
if s[j]=="#":
E.add((i-i_min,j-j_min))
return E
N=int(input())
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
def encode(S):
    i_min=10000
    j_min=10000

    for i in range(N):
        s=S[i]
        for j in range(N):
            if s[j]=="#":
                i_min=min(i_min,i)
                j_min=min(j_min,j)

    E=set()
    for i in range(N):
        s=S[i]
        for j in range(N):
            if s[j]=="#":
                E.add((i-i_min,j-j_min))

    return E

N=int(input())
S=[]
for _ in range(N):
    S.append(list(input()))

T=[]
for _ in range(N):
    T.append(list(input()))

T_set=encode(T)
for _ in range(4):
    S_set=encode(S)
    if S_set==T_set:
        exit(print("Yes"))

    S=[list(x)[::-1] for x in zip(*S)]

print("No")

Submission Info

Submission Time
Task C - Shapes
User Kazu1998k
Language PyPy3 (7.3.0)
Score 300
Code Size 684 Byte
Status AC
Exec Time 123 ms
Memory 93236 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 20
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt, hand_07.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
Case Name Status Exec Time Memory
hand_01.txt AC 88 ms 61880 KB
hand_02.txt AC 51 ms 61844 KB
hand_03.txt AC 52 ms 61912 KB
hand_04.txt AC 51 ms 61856 KB
hand_05.txt AC 50 ms 61732 KB
hand_06.txt AC 77 ms 76448 KB
hand_07.txt AC 72 ms 76496 KB
random_01.txt AC 91 ms 75332 KB
random_02.txt AC 53 ms 61900 KB
random_03.txt AC 92 ms 76976 KB
random_04.txt AC 74 ms 75340 KB
random_05.txt AC 96 ms 78076 KB
random_06.txt AC 91 ms 76828 KB
random_07.txt AC 123 ms 93064 KB
random_08.txt AC 121 ms 93236 KB
random_09.txt AC 85 ms 85964 KB
sample_01.txt AC 51 ms 61884 KB
sample_02.txt AC 53 ms 61888 KB
sample_03.txt AC 52 ms 61764 KB
sample_04.txt AC 53 ms 61924 KB


2025-04-05 (Sat)
15:36:59 +00:00