Submission #2243940
Source Code Expand
def contains(a, b, n, m): def eq(i, j): for row in range(m): if b[row] != a[i + row][j:j+m]: return False return True for i in range(n - m + 1): for j in range(n - m + 1): if eq(i, j): return True return False if __name__ == '__main__': n, m = list(map(int, input().split())) a = [list(input()) for _ in range(n)] b = [list(input()) for _ in range(m)] print('Yes') if contains(a, b, n, m) else print('No')
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | tekess |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 534 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 | 3060 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 |