Submission #1520355
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scan = new Scanner(System.in); int n = scan.nextInt(); int m = scan.nextInt(); String[] a = new String[n]; String[] b = new String[m]; for (int i = 0; i < n; i++) { a[i] = scan.next(); } for (int i = 0; i < m; i++) { b[i] = scan.next(); } for (int i = 0; i <= n - m; i++) { for (int k = 0; k <= n - m; k++) { boolean flag = true; for (int j = 0; j < m; j++) { String temp = a[j + i].substring(k, k + m); if (!temp.equals(b[j])) { flag = false; break; } } if (flag) { System.out.println("Yes"); return; } flag = true; } } System.out.println("No"); } }
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | edna |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 781 Byte |
Status | AC |
Exec Time | 108 ms |
Memory | 23892 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 | 91 ms | 18772 KB |
sample_02.txt | AC | 91 ms | 19924 KB |
subtask_1_01.txt | AC | 90 ms | 19796 KB |
subtask_1_02.txt | AC | 91 ms | 20688 KB |
subtask_1_03.txt | AC | 103 ms | 19792 KB |
subtask_1_04.txt | AC | 95 ms | 23892 KB |
subtask_1_05.txt | AC | 95 ms | 21716 KB |
subtask_1_06.txt | AC | 106 ms | 21076 KB |
subtask_1_07.txt | AC | 108 ms | 18768 KB |
subtask_1_08.txt | AC | 96 ms | 19668 KB |