Submission #1519765
Source Code Expand
#include <iostream> #include <cmath> #include <string> using namespace std; int main() { int n, m; cin >> n >> m; string A[52], B[52]; bool flag = true; for (int i = 1; i <= n; i++) cin >> A[i]; for (int i = 1; i <= m; i++) cin >> B[i]; for (int i = 1; i <= n + 1 - m; i++) { for (int j = 1; j <= n + 1 - m; j++) { for (int o = 0; o < m; o++) { for (int p = 0; p < m; p++) { if (A[i + o][j + p] != B[1 + o][1 + p]) { flag = false; } cout << flag << endl; } } if (flag) { cout << "Yes" << endl; return 0; } } } cout << "No" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | Oike7 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 642 Byte |
Status | WA |
Exec Time | 651 ms |
Memory | 1024 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 | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
subtask_1_01.txt | WA | 1 ms | 256 KB |
subtask_1_02.txt | WA | 1 ms | 256 KB |
subtask_1_03.txt | WA | 2 ms | 256 KB |
subtask_1_04.txt | WA | 37 ms | 256 KB |
subtask_1_05.txt | WA | 40 ms | 256 KB |
subtask_1_06.txt | WA | 17 ms | 256 KB |
subtask_1_07.txt | WA | 651 ms | 1024 KB |
subtask_1_08.txt | WA | 33 ms | 256 KB |