Submission #1873201
Source Code Expand
#include <iostream> #include <algorithm> #include <queue> #include <vector> using namespace std; typedef long long ll; typedef struct pair<int,int> P; typedef struct pair<int,P> P2; ll d[1001]={}; int a[100001]={}; int main() { char a[50][50]; char b[50][50]; int n,m; cin>>n>>m; char chr; for(int i=0;i<n;++i){ for(int j=0;j<n;++j){ cin>>chr; a[i][j]=chr; } } for(int i=0;i<m;++i){ for(int j=0;j<m;++j){ cin>>chr; b[i][j]=chr; } } bool res=false; for(int i=0;i<n-m;++i){ for(int j=0;j<n-m;++j){ bool flg=true; for(int o=0;o<m;++o){ for(int p=0;p<m;++p){ if(a[i+o][j+p]!=b[o][p])flg=false; } } if(flg)res=true; } } if(res){ cout<<"Yes"<<endl; }else{ cout<<"No"<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | fgtohru |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 806 Byte |
Status | WA |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 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 |