Submission #1870885
Source Code Expand
import sys N,M=map(int,raw_input().split()) a=[raw_input() for _ in range(N)] b=[raw_input() for _ in range(M)] #print a #print b c=[] for i in range(N-M+1): for j in range(N-M+1): tmp_c=[] for k in range(M): #print a[i+k][j:j+M] tmp_c.append(a[i+k][j:j+M]) c.append(tmp_c) print "Yes" if b in c else "No"
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | KUMAWO |
Language | Python (2.7.6) |
Score | 200 |
Code Size | 340 Byte |
Status | AC |
Exec Time | 15 ms |
Memory | 3844 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 | 10 ms | 2568 KB |
sample_02.txt | AC | 10 ms | 2568 KB |
subtask_1_01.txt | AC | 10 ms | 2568 KB |
subtask_1_02.txt | AC | 10 ms | 2568 KB |
subtask_1_03.txt | AC | 10 ms | 2568 KB |
subtask_1_04.txt | AC | 11 ms | 2692 KB |
subtask_1_05.txt | AC | 12 ms | 2948 KB |
subtask_1_06.txt | AC | 10 ms | 2568 KB |
subtask_1_07.txt | AC | 15 ms | 3844 KB |
subtask_1_08.txt | AC | 13 ms | 3076 KB |