Submission #2243071
Source Code Expand
n,m = (int(i) for i in input().split()) a = [input() for i in range(n)] b = [input() for i in range(m)] answer ="No" for i in range(n-m+1): for j in range(n-m+1): num = 0 for k in range(m): if all(a[i+k][j+k2]==b[k][k2] for k2 in range(m)): num += 1 if num == m: answer = "Yes" break break print(answer)
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | Clamperl |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 340 Byte |
Status | AC |
Exec Time | 36 ms |
Memory | 3188 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 | 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 | 18 ms | 3064 KB |
subtask_1_04.txt | AC | 20 ms | 3188 KB |
subtask_1_05.txt | AC | 24 ms | 3064 KB |
subtask_1_06.txt | AC | 18 ms | 3064 KB |
subtask_1_07.txt | AC | 36 ms | 3060 KB |
subtask_1_08.txt | AC | 25 ms | 3064 KB |