【JZOJ4761】鼎纹

description

---

analysis

• 暴力

• 想象一下，当前矩阵的最左上角的$1$，如果不覆盖那么以后再没有机会去覆盖

• 那么暴力覆盖就好了，边暴力边判断

---

code

#pragma GCC optimize("O3")
#pragma G++ optimize("O3")
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define MAXN 1005
#define ll long long
#define reg register ll
#define fo(i,a,b) for (reg i=a;i<=b;++i)
#define fd(i,a,b) for (reg i=a;i>=b;--i)
#define O3 __attribute__((optimize("-O3")))

using namespace std;

ll f[MAXN][MAXN],g[MAXN][MAXN],h[MAXN][MAXN];
ll n,m,a,b,T,begx,begy;
char s[MAXN];
bool flag;

O3 inline ll read()
{
	ll x=0,f=1;char ch=getchar();
	while (ch<'0' || '9'<ch){if (ch=='-')f=-1;ch=getchar();}
	while ('0'<=ch && ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
O3 int main()
{
	//freopen("T1.in","r",stdin);
	T=read();
	while (T--)
	{
		memset(f,0,sizeof(f)),memset(g,0,sizeof(g)),memset(h,0,sizeof(h));
		n=read(),m=read(),a=read(),b=read(),begx=0,begy=0;
		fo(i,1,n)
		{
			scanf("%s",s+1);
			fo(j,1,m)f[i][j]=h[i][j]=s[j]-'0';
		}
		fo(i,1,a)
		{
			scanf("%s",s+1);
			fo(j,1,b)
			{
				g[i][j]=s[j]-'0';
				if (g[i][j] && begx==0 && begy==0)begx=i,begy=j;
			}
		}
		flag=1;
		fo(i,1,n)
		{
			fo(j,1,m)if (f[i][j]==1)
			{
				fo(k,begx,a)
				{
					fo(l,1,b)if (g[k][l])
					{
						ll xx=i+k-begx,yy=j+l-begy;
						if (xx<1 || xx>n || yy<1 || yy>m || f[xx][yy]<1)
						{
							flag=0;
							break;
						}
						--f[xx][yy];
					}
					if (!flag)break;
				}
				if (!flag)break;
			}
			if (!flag)break;
		}
		fo(i,1,n)
		{
			fo(j,1,m)if (f[i][j]!=0)
			{
				flag=0;
				break;
			}
			if (!flag)break;
		}
		printf(flag?"YES\n":"NO\n");
	}
	return 0;
}