Submission #1254646

---

Source Code Expand

#include"bits/stdc++.h"
//#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define print(x) cout<<x<<endl;
typedef long long ll;

int main() {
	int n,m;
	string a[52], b[52];
	int tmp=0,tmp_j=0;
	cin >> n >> m;
	int flag = 1;
	rep(i, 0, n)cin >> a[i];
	rep(i, 0, m)cin >> b[i];
	rep(i, 0, n - m + 1) {
		rep(j, 0, m) {
			tmp = 0;
			tmp_j = 0;
			while (a[i].find(b[j], tmp) >= 0) {
				flag = 1;
				tmp = a[i].find(b[j], tmp);
				tmp_j = j;
				rep(k, tmp_j, m + tmp_j) {
					if (tmp == a[i+k-tmp_j].find(b[k]))
						flag += 1;
				}
				tmp += 1;
			}
			if (flag == m) { break; }
		}
		if (flag == m) { break; }
	}
	if(flag==m){print("Yes") }
	else {print("No") }
	return 0;
}

Submission Info

Judge Result