Submission #1371792
Source Code Expand
# -*- coding: utf-8 -*- import sys import subprocess import json import time import math import re import sqlite3 N, M = map(int, input().split()) A = [] B = [] for i in range(N): A.append(input()) for i in range(M): B.append(input()) for i in range(N-M+1): for j in range(N-M+1): ok = True for k in range(M): for l in range(M): if A[i+k][j+l] != B[k][l]: ok = False; if ok: print("Yes") exit(0) print("No")
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | naimonon77 |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 533 Byte |
Status | AC |
Exec Time | 182 ms |
Memory | 4564 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 | 33 ms | 4436 KB |
sample_02.txt | AC | 33 ms | 4436 KB |
subtask_1_01.txt | AC | 34 ms | 4436 KB |
subtask_1_02.txt | AC | 34 ms | 4436 KB |
subtask_1_03.txt | AC | 34 ms | 4436 KB |
subtask_1_04.txt | AC | 41 ms | 4436 KB |
subtask_1_05.txt | AC | 43 ms | 4436 KB |
subtask_1_06.txt | AC | 36 ms | 4564 KB |
subtask_1_07.txt | AC | 182 ms | 4564 KB |
subtask_1_08.txt | AC | 34 ms | 4436 KB |