Submission #33992560

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;

int n1, m1;
int a[20][20];
int n2, m2;
int b[20][20];
int c[20][20];
int d[20][20];
bool ans;

void recur2(int cur, int idx)
{
	int i, j;
	bool flag;

	if (idx == m2)
	{
		flag = true;
		for (i = 0; i < n2; i++)
		{
			for (j = 0; j < m2; j++)
			{
				if (b[i][j] != d[i][j]) flag = false;
			}
		}

		if (flag) ans = true;

		return;
	}
	if (cur == m1) return;

	for (i = 0; i < n2; i++)
	{
		d[i][idx] = c[i][cur];
	}
	recur2(cur + 1, idx + 1);
	recur2(cur + 1, idx);
}

void recur(int cur, int idx)
{
	int i;

	if (idx == n2)
	{
		recur2(0, 0);

		return;
	}

	if (cur == n1) return;

	for (i = 0; i < m1; i++)
	{
		c[idx][i] = a[cur][i];
	}
	recur(cur + 1, idx + 1);
	recur(cur + 1, idx);
}

int main()
{
	int i, j;

	cin >> n1 >> m1;
	for (i = 0; i < n1; i++)
	{
		for (j = 0; j < m1; j++)
		{
			cin >> a[i][j];
		}
	}
	cin >> n2 >> m2;
	for (i = 0; i < n2; i++)
	{
		for (j = 0; j < m2; j++)
		{
			cin >> b[i][j];
		}
	}

	recur(0, 0);

	if (ans) cout << "Yes";
	else cout << "No";
}

Submission Info

Judge Result