Submission #2244440


Source Code Expand

N,M=map(int,input().split())
A=[[] for i in range(N)]
B=[[] for j in range(M)]

for i in range(N):
  s=input().strip()
  A[i]=list(s)
for i in range(M):
  s=input().strip()
  B[i]=list(s)

def check(a,b):
  for i in range(M):
    for j in range(M):
      if A[i+a][j+b] != B[i][j]:
        return False
  return True

ch=False
for i in range(N-M+1):
  if ch:
    break
  for j in range(N-M+1):
    ch=check(i,j)
    if ch:
      break
if ch:
  print("Yes")
else:
  print("No")

Submission Info

Submission Time
Task B - Template Matching
User kobaya0514
Language Python (3.4.3)
Score 200
Code Size 505 Byte
Status AC
Exec Time 18 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt
Case Name Status Exec Time Memory
sample_01.txt AC 17 ms 3064 KB
sample_02.txt AC 17 ms 3064 KB
subtask_1_01.txt AC 17 ms 3064 KB
subtask_1_02.txt AC 17 ms 3064 KB
subtask_1_03.txt AC 17 ms 3064 KB
subtask_1_04.txt AC 17 ms 3064 KB
subtask_1_05.txt AC 18 ms 3064 KB
subtask_1_06.txt AC 17 ms 3064 KB
subtask_1_07.txt AC 18 ms 3064 KB
subtask_1_08.txt AC 17 ms 3064 KB