Submission #1248157
Source Code Expand
def bsolve(a,b,c,d): M=len(b) for i in range(M): for j in range(M): if(a[c+i][d+j]!=b[i][j]): return 0 return 1 def b(): N,M=list(map(int,input().split())) A=[input()for _ in range(N)] B=[input()for _ in range(M)] flag=0 for i in range(N-M+1): for j in range(N-M+1): if(A[i][j]==B[0][0]): flag=bsolve(A,B,i,j) if(flag==1): print("Yes") return if(flag==1): print("Yes") else: print("No") b()
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | dedad |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 460 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 | 17 ms | 3064 KB |
subtask_1_07.txt | AC | 18 ms | 3064 KB |
subtask_1_08.txt | AC | 17 ms | 3064 KB |