Submission #4048015
Source Code Expand
#include<bits/stdc++.h> using namespace std; int main(){ int n, m; char a[50][50], b[50][50]; cin >> n >> m; for(int x=0;x<n;x++) for(int y=0;y<n;y++) cin >> a[x][y]; for(int x=0;x<m;x++) for(int y=0;y<m;y++) cin >> b[x][y]; bool exit = false; for(int x=0;x<=n-m && !exit;x++){ for(int y=0;y<=n-m && !exit;y++){ bool f = true; for(int dx=0;dx<m && f;dx++){ for(int dy=0;dy<m && f;dy++){ if(b[dx][dy] != a[x+dx][y+dy]) f = false; } } if(f) exit = true; } } cout << (exit?"Yes":"No") << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | kilattoeruru |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 617 Byte |
Status | AC |
Exec Time | 1 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 | 1 ms | 256 KB |
subtask_1_07.txt | AC | 1 ms | 256 KB |
subtask_1_08.txt | AC | 1 ms | 256 KB |