0分求调

#include <bits/stdc++.h>
using namespace std;
int a[101][101], b[18], c[18] = {0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0};
int main() {
	int t;
	int n, m;
	cin >> t;
	for (int i = 0; i < t; i++) {
		cin >> n >> m;
		for (int j = 0; j < n; j++)for (int k = 0; k < m; k++)cin >> a[j][k];
		bool cnt = false;
		for (int j = 0; j < n - 3; j++) {
			if(cnt==true)break;
			for (int u = 0; u < m - 3; u++) {
				int s = 0;
				for (int k = j; k <= j + 3; k++) {
					for (int l = u; l <= u + 3; l++) {
						b[s] = a[k][l];
						s++;
					}
				}
				int k;
				for(k=0;k<16;k++)if(b[k]!=c[k])break;
				if(k==16)cnt=true;
			}
		}
		if(cnt)cout<<"Yes";
		else cout<<"No";
		cout<<endl;
	}

	return 0;
}