Submission #1104859
Source Code Expand
n,m=map(int,input().split()) master,sub=[],[] for i in range(n): master.append(input()) for j in range(m): sub.append(input()) def chk(a,b,y,x): t=len(b) for i in range(t): if a[y+i][x:x+t]!=b[i]: return 0 return 1 for i in range(n-m+1): for j in range(n-m+1): if master[i][j:j+m]==sub[0]: if chk(master,sub,i,j): print('Yes') exit() print('No')
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | nyon |
Language | PyPy3 (2.4.0) |
Score | 200 |
Code Size | 461 Byte |
Status | AC |
Exec Time | 164 ms |
Memory | 38384 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 | 162 ms | 38384 KB |
sample_02.txt | AC | 161 ms | 38256 KB |
subtask_1_01.txt | AC | 164 ms | 38256 KB |
subtask_1_02.txt | AC | 161 ms | 38256 KB |
subtask_1_03.txt | AC | 160 ms | 38256 KB |
subtask_1_04.txt | AC | 164 ms | 38332 KB |
subtask_1_05.txt | AC | 162 ms | 38384 KB |
subtask_1_06.txt | AC | 163 ms | 38256 KB |
subtask_1_07.txt | AC | 162 ms | 38256 KB |
subtask_1_08.txt | AC | 161 ms | 38256 KB |