Submission #1768859

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int N, M; cin >> N >> M;
	vector<string> A(N, string(N, '.'));
	vector<string> B(M, string(M, '.'));

	rep (i, N) cin >> A[i];
	rep (j, M) cin >> B[j];

	bool match = false;
	for (int i = 0; i < N - M + 1; ++i){
		for (int j = 0; j < N - M + 1; ++j){
			bool curr = true;
//			cerr << i << " rows: " << j << " cols:" << endl;
			for (int k = 0; k < M; ++k){
				for (int l = 0; l < M; ++l){ 
					if (A[i+k][j+l] != B[k][l]){
						curr = false;
						break;
					} // end if
				} // end for
				if (!curr) break;
			} // end for
			match |= curr;
		} // end for
	} // end for

	cout << (match ? "Yes" : "No") << endl;

	return 0;
}

Submission Info

Judge Result