Submission #1779972
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <stack>
#include <queue>
#include <complex>
#include <set>
#include <list>
#include <iomanip>
#include <map>
#include <memory.h>
using namespace std;
static const double EPS = 1e-9;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i,n) for(int i=0;i<(int)n;++i)
#define FORNUM(p, x) for (int num = p; num < (int)(x); ++num)
#define FORI(p, x) for (int i = p; i < (int)(x); ++i)
#define FORJ(p, x) for (int j = p; j < (int)(x); ++j)
#define FORK(p, x) for (int k = p; k < (int)(x); ++k)
#define FORL(p, x) for (int l = p; l < (int)(x); ++l)
typedef pair<int,int>P;
#define INF 1000000000
struct edge {
int from, to,cap,rev;
edge (int from, int to, int cap, int rev){
this->from=from; this->to=to; this->cap=cap; this->rev=rev;
}
};
int V,E;
typedef vector<edge> edges;
vector<edges> G;
string ban[60], pat[60];
int n, m;
bool match(int x, int y) {
FORI(0, m) {
FORJ(0, m) {
if (ban[x + i][y + j] != pat[i][j])
return false;
}
}
return true;
}
int main(){
cin >> n >> m;
FORI(0, n)cin >> ban[i];
FORI(0, m)cin >> pat[i];
bool flg = false;
FORI(0, n - m + 1) {
FORJ(0, n - m + 1) {
if (match(i, j)){
flg = true;
}
}
}
cout << (flg ? "Yes" : "No") << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Template Matching |
User |
cypher512 |
Language |
C++14 (GCC 5.4.1) |
Score |
200 |
Code Size |
1476 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 |