Submission #4046055
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<complex> #include<string.h> #include<string> using namespace std; typedef long long int llint; int main() { int n, m; cin >> n >> m; vector<string>a(n); vector<string>b(m); for (int i = 0;i < n;i++) { cin >> a[i]; } for (int i = 0;i < m;i++) { cin >> b[i]; } int tmp; for (int i = 0;i <= n - m;i++) { for (int j = 0;j < m;j++) { if (j == 0) { tmp = a[i + j].find(b[j]); } else { if (tmp != a[i + j].find(b[j])) { break; } if (j == m - 1) { cout << "Yes" << endl; return 0; } } } } cout << "No" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Template Matching |
User | tRue |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 647 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 | WA | 1 ms | 256 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | WA | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | WA | 2 ms | 256 KB |
subtask_1_07.txt | WA | 2 ms | 256 KB |
subtask_1_08.txt | WA | 2 ms | 256 KB |