Submission #1591610


Source Code Expand

n,m = map(int,input().split())
base = [input() for _ in range(n)]
tmp = [input() for _ in range(m)]
count = 0
flg = False

for i in range(n - m + 1):
    for j in range(n - m + 1):
        for k in range(m):
            if base[i + k][j:j+m] == tmp[k]:
                count += 1
            else:
                break
        if count == m:
            flg = True
            break
        else:
            count = 0
if flg:
    print("Yes")
else:
    print("No")

Submission Info

Submission Time
Task B - Template Matching
User s_naoya
Language Python (3.4.3)
Score 200
Code Size 487 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 3060 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 17 ms 3064 KB
subtask_1_08.txt AC 18 ms 3064 KB