Submission #1588992
Source Code Expand
#include<iostream> #include<string> #include<string.h> #include<algorithm> #include<stdio.h> #include<cmath> #define FOR(i, a, b) for(int i=(a);i<=(b);i++) #define RFOR(i, a, b) for(int i=(a);i>=(b);i--) using namespace std; int main(void) { int n, m; int flag=0; char a[51][51], b[51][51]; cin >> n >> m; FOR(i, 0, n-1) { cin >> a[i]; } FOR(i, 0, m-1) { cin >> b[i]; } FOR(i, 0, n-m) { FOR(t, 0, n-m) { if (a[i][t] == b[0][0]) { FOR(s, 0, m-1) { FOR(p, 0, m-1) { if (a[i+s][t+p] != b[s][p]) { p = m ; s = m ; } if ((s == m-1) && (p == m-1)) { flag = 1; } } } } } } if (flag == 1) { cout << "Yes" << endl; } else { cout << "No" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | yukiteru |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 792 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 |