Submission #4047699


Source Code Expand

from itertools import product

n, m = [int(x) for x in input().split()]

a = [input() for x in range(n)]
b = [input() for x in range(m)]
ret = 'No'

for i, j in product(range(n - m + 1), range(n - m + 1)):
    if all([a[i + k][j:m + j] == x for k, x in enumerate(b)]):
        ret = 'Yes'
        break
print(ret)

Submission Info

Submission Time
Task B - Template Matching
User masakun
Language Python (3.4.3)
Score 200
Code Size 327 Byte
Status AC
Exec Time 25 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 20 ms 3060 KB
sample_02.txt AC 19 ms 3060 KB
subtask_1_01.txt AC 20 ms 3060 KB
subtask_1_02.txt AC 20 ms 3060 KB
subtask_1_03.txt AC 19 ms 3060 KB
subtask_1_04.txt AC 21 ms 3060 KB
subtask_1_05.txt AC 22 ms 3064 KB
subtask_1_06.txt AC 20 ms 3060 KB
subtask_1_07.txt AC 25 ms 3060 KB
subtask_1_08.txt AC 20 ms 3060 KB