Submission #2560614
Source Code Expand
n,m=map(int,input().split()) a=[list(input())for i in range(n)] b=[list(input())for i in range(m)] def match(x,y): for i in range(m): for j in range(m): if a[x+i][y+j]!=b[i][j]: return False return True for i in range(n-m+1): for j in range(n-m+1): judge=False if a[i][j]==b[0][0]: if match(i,j): judge=True if judge: print("Yes") exit() print("No")
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | dexctercom |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 503 Byte |
Status | AC |
Exec Time | 18 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 | 17 ms | 3064 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 | 18 ms | 3064 KB |
subtask_1_07.txt | AC | 18 ms | 3064 KB |
subtask_1_08.txt | AC | 17 ms | 3064 KB |