Submission #26365482
Source Code Expand
#input
n, m = map(int, input().split())
a = [[] for _ in range(n)]
b = [[] for _ in range(m)]
for i in range(n):
a[i] = input()
for j in range(m):
b[j] = input()
#output
answer = "No"
for i in range(n-m+1):
for j in range(n-m+1):
c = [item[i:i+m] for item in a][j:j+m]
if c == b:
answer = "Yes"
print(answer)
Submission Info
| Submission Time | |
|---|---|
| Task | B - Template Matching |
| User | denovo2021 |
| Language | Python (3.8.2) |
| Score | 200 |
| Code Size | 365 Byte |
| Status | AC |
| Exec Time | 39 ms |
| Memory | 8920 KiB |
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 | 25 ms | 8760 KiB |
| sample_02.txt | AC | 21 ms | 8872 KiB |
| subtask_1_01.txt | AC | 25 ms | 8912 KiB |
| subtask_1_02.txt | AC | 21 ms | 8760 KiB |
| subtask_1_03.txt | AC | 22 ms | 8912 KiB |
| subtask_1_04.txt | AC | 19 ms | 8920 KiB |
| subtask_1_05.txt | AC | 23 ms | 8876 KiB |
| subtask_1_06.txt | AC | 23 ms | 8764 KiB |
| subtask_1_07.txt | AC | 26 ms | 8920 KiB |
| subtask_1_08.txt | AC | 39 ms | 8760 KiB |