Submission #1873201

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef struct pair<int,int> P;
typedef struct pair<int,P> P2;

ll d[1001]={};
int a[100001]={};
int main() {
	char a[50][50];
	char b[50][50];
	int n,m;
	cin>>n>>m;
	char chr;
	for(int i=0;i<n;++i){
		for(int j=0;j<n;++j){
			cin>>chr;
			a[i][j]=chr;
		}
	}
	for(int i=0;i<m;++i){
		for(int j=0;j<m;++j){
			cin>>chr;
			b[i][j]=chr;
		}
	}

	bool res=false;
	for(int i=0;i<n-m;++i){
		for(int j=0;j<n-m;++j){
			bool flg=true;
			for(int o=0;o<m;++o){
				for(int p=0;p<m;++p){
					if(a[i+o][j+p]!=b[o][p])flg=false;
				}
			}
			if(flg)res=true;
		}
	}
	if(res){
		cout<<"Yes"<<endl;
	}else{
		cout<<"No"<<endl;

	}
	return 0;
}

Submission Info

Judge Result