Submission #1776268


Source Code Expand

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int m = scanner.nextInt();
		int count = 0;
		char[][] a = new char[n][n];
		char[][] b = new char[m][m];

		for(int i = 0; i < n; i++){
			a[i] = scanner.next().toCharArray();
		}
		for(int i = 0; i < m; i++){
			b[i] = scanner.next().toCharArray();
		}

		for(int i = 0; i < n-m; i++){
			count = 0;
			int l = 0;
			for(int j = 0; j < n-m; j++){
				if(a[i][j] == b[0][l]){
					count++;
					for(int k = 1; k < m; k++){
						if(a[i+k][j] == b[k][l]){
							count++;
							l++;
						}
					}
				}
			}
			if(count == m*m){
				System.out.println("Yes");
				return;
			}
		}
		System.out.println("No");
	}
}

Submission Info

Submission Time
Task B - Template Matching
User unirita152
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 818 Byte
Status RE
Exec Time 114 ms
Memory 22356 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 1
WA × 1
AC × 3
WA × 2
RE × 5
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 WA 110 ms 22356 KB
sample_02.txt AC 93 ms 20692 KB
subtask_1_01.txt WA 93 ms 19540 KB
subtask_1_02.txt AC 96 ms 20948 KB
subtask_1_03.txt RE 99 ms 20820 KB
subtask_1_04.txt RE 98 ms 20560 KB
subtask_1_05.txt RE 97 ms 20564 KB
subtask_1_06.txt AC 110 ms 20052 KB
subtask_1_07.txt RE 114 ms 22100 KB
subtask_1_08.txt RE 98 ms 20564 KB