Submission #1770937
Source Code Expand
#include<bits/stdc++.h> using namespace std; typedef long long LL; typedef pair<LL,LL> P; int main(){ int N,M; cin >> N >> M; char a[N][N]; char b[M][M]; for(int i=0;i<N;i++){ for(int j=0;j<N;j++){ cin >> a[i][j]; } } for(int i=0;i<M;i++){ for(int j=0;j<M;j++){ cin >> b[i][j]; } } for(int i=0;i<=N-M;i++){ for(int j=0;j<=N-M;j++){ int count=0; for(int u=0;u<M;u++){ for(int v=0;v<M;v++){ if(a[i+u][j+v]==b[u][v]) count++; if(count==M*M){ puts("Yes"); return 0; } } } } } puts("No"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | Yukly |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 828 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 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 | 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 | 2 ms | 256 KB |
subtask_1_07.txt | AC | 2 ms | 256 KB |
subtask_1_08.txt | AC | 1 ms | 256 KB |