Submission #1779138
Source Code Expand
N, M = map(int, input().split()) A = [input() for _ in range(N)] B = "".join([input() for _ in range(M)]) Z = N - M + 1 ans = [["".join(A[i+k][j:j+M] for k in range(M)) == B for i in range(Z)] for j in range(Z)] for b in ans: if True in b: print("Yes") break else: print("No")
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | pytry3g |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 314 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 | 16 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 3060 KB |
subtask_1_01.txt | AC | 17 ms | 3060 KB |
subtask_1_02.txt | AC | 17 ms | 3060 KB |
subtask_1_03.txt | AC | 17 ms | 3060 KB |
subtask_1_04.txt | AC | 17 ms | 3064 KB |
subtask_1_05.txt | AC | 19 ms | 3064 KB |
subtask_1_06.txt | AC | 17 ms | 3060 KB |
subtask_1_07.txt | AC | 21 ms | 3064 KB |
subtask_1_08.txt | AC | 21 ms | 3060 KB |