Submission #2246978
Source Code Expand
import java.util.*; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int M = sc.nextInt(); String[] a = new String[N]; String[] b = new String[M]; boolean exist = false; for(int i = 0;i < N;i++)a[i] = sc.next(); for(int i = 0;i < M;i++)b[i] = sc.next(); out: for(int i = 0;i < N-M+1;i++) { for(int j = 0;j < N-M+1;j++) { for(int k = 0;k<M;k++) { if(!(a[j+k].substring(i,i+M).equals(b[k]))) break; if(k == M - 1) { exist = true; break out; } } } } if(exist) System.out.println("Yes"); else System.out.println("No"); }}
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | Sodeimo |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 701 Byte |
Status | AC |
Exec Time | 112 ms |
Memory | 23764 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 | 112 ms | 21204 KB |
sample_02.txt | AC | 91 ms | 19924 KB |
subtask_1_01.txt | AC | 90 ms | 19924 KB |
subtask_1_02.txt | AC | 93 ms | 21076 KB |
subtask_1_03.txt | AC | 92 ms | 21844 KB |
subtask_1_04.txt | AC | 93 ms | 18640 KB |
subtask_1_05.txt | AC | 95 ms | 23764 KB |
subtask_1_06.txt | AC | 110 ms | 19668 KB |
subtask_1_07.txt | AC | 102 ms | 19284 KB |
subtask_1_08.txt | AC | 97 ms | 20180 KB |