Submission #3416664
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main(){ int a,b; cin>>a>>b; char c[a][a]; char d[b][b]; for(int i=0;i<a;i++){ for(int j=0;j<a;j++){ cin>>c[i][j]; } } for(int i=0;i<b;i++){ for(int j=0;j<b;j++){ cin>>d[i][j]; } } int e; for(int i=0;i<a-b+1;i++){ for(int j=0;j<a-b+1;j++){ if(d[0][0]==c[i][j]){ e=0; for(int k=0;k<b;k++){ for(int l=0;l<b;l++){ if(d[k][l]==c[i+k][j+l]) e++; if(e==b*b){ cout<<"Yes"; return 0; } } } } } } cout<<"No"; }
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | occhan |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 680 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 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 | 2 ms | 384 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 |