Submission #10314055
Source Code Expand
n, m = map(int, input().split()) a = [list(input()) for _ in range(n)] b = [list(input()) for _ in range(m)] si, sj = 0, 0 c = 0 while si < n - m: ni, nj = si, sj rest = m ** 2 for i in range(m): nj = sj for j in range(m): # print(ni, nj, i, j) if a[ni][nj] != b[i][j]: break nj +=1 rest -= 1 ni += 1 # print() if rest == 0: print("Yes") exit() sj += 1 if sj > n - m: si += 1 sj = 0 print("No")
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | michi1750 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 581 Byte |
Status | WA |
Exec Time | 34 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 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 | 19 ms | 3064 KB |
subtask_1_05.txt | AC | 23 ms | 3064 KB |
subtask_1_06.txt | AC | 18 ms | 3064 KB |
subtask_1_07.txt | AC | 34 ms | 3064 KB |
subtask_1_08.txt | AC | 18 ms | 3064 KB |