Submission #1104870


Source Code Expand

#include <bits/stdc++.h>

using namespace std;


int main()
{
  int N, M;
  string S[50];
  string T[50];

  cin >> N >> M;
  for(int i = 0; i < N; i++) cin >> S[i];
  for(int i = 0; i < M; i++) cin >> T[i];

  for(int i = 0; i <= N - M; i++) {
    for(int j = 0; j <= N - M; j++) {
      bool match = true;
      for(int k = 0; k < M; k++) {
        for(int l = 0; l < M; l++) {
          match &= S[i + k][j + l] == T[k][l];
        }
      }
      if(match) {
        cout << "Yes" << endl;
        return (0);
      }
    }
  }
  cout << "No" << endl;
}

Submission Info

Submission Time
Task B - Template Matching
User ei13333
Language C++14 (GCC 5.4.1)
Score 200
Code Size 587 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
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 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 1 ms 256 KB
subtask_1_04.txt AC 1 ms 256 KB
subtask_1_05.txt AC 1 ms 256 KB
subtask_1_06.txt AC 1 ms 256 KB
subtask_1_07.txt AC 2 ms 256 KB
subtask_1_08.txt AC 1 ms 256 KB