Submission #1791516


Source Code Expand

n, m = map(int, input().split())
a, b = [], []
for i in range(n):
    a.append(input())
for i in range(m):
    b.append(input())
for i in range(n - m + 1):
    for j in range(len(a[0]) - len(b[0]) + 1):
        for k in range(m):
            if a[i+k][j:(j+m)] != b[k]:
                break
            print('Yes')
            quit()
print('No')

Submission Info

Submission Time
Task B - Template Matching
User Kirin0890
Language Python (3.4.3)
Score 0
Code Size 360 Byte
Status WA
Exec Time 17 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 2
AC × 8
WA × 2
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 3060 KB
sample_02.txt AC 17 ms 3064 KB
subtask_1_01.txt AC 17 ms 3060 KB
subtask_1_02.txt WA 17 ms 3064 KB
subtask_1_03.txt AC 17 ms 3064 KB
subtask_1_04.txt AC 17 ms 3060 KB
subtask_1_05.txt WA 17 ms 3060 KB
subtask_1_06.txt AC 17 ms 3060 KB
subtask_1_07.txt AC 17 ms 3064 KB
subtask_1_08.txt AC 17 ms 3064 KB