Submission #1781766
Source Code Expand
import java.util.Scanner; 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]; for(int i = 0 ; i < n ; i++) a[i] = sc.next(); for(int i = 0 ; i < m ; i++) b[i] = sc.next(); for(int i = 0 ; i <= n - m ; i++) { for(int j = 0 ; j <= n - m ; j++) { boolean ok = true; for(int k = 0 ; k < m ; k++) { for(int l = 0 ; l < m ; l++) { int x = i + k; int y = j + l; if(a[x].charAt(y) != b[k].charAt(l)) { ok = false; } } } if(ok == true) { System.out.println("Yes"); return; } } } System.out.println("No"); } }
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | kouta1612 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 780 Byte |
Status | AC |
Exec Time | 137 ms |
Memory | 23380 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 | 101 ms | 23380 KB |
sample_02.txt | AC | 101 ms | 21972 KB |
subtask_1_01.txt | AC | 99 ms | 18772 KB |
subtask_1_02.txt | AC | 101 ms | 19024 KB |
subtask_1_03.txt | AC | 102 ms | 20564 KB |
subtask_1_04.txt | AC | 106 ms | 21844 KB |
subtask_1_05.txt | AC | 107 ms | 17620 KB |
subtask_1_06.txt | AC | 120 ms | 21972 KB |
subtask_1_07.txt | AC | 137 ms | 21588 KB |
subtask_1_08.txt | AC | 104 ms | 19796 KB |