1 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=1010; char g[N][N]; int main() { int t; cin>>t; while(t--) { int n,m; cin>>n>>m; for(int i=0;i<n;i++) cin>>g[i]; bool st=false; for(int l=0;l+3<n;l++) { for(int u=0;u+3<m;u++) { int cnt1=0,cnt2=0; for(int i=1;i<3;i++) { for(int j=1;j<3;j++) { if(g[i+l][j+u]=='1') { cnt1++; } } } for(int i=0;i<4;i++) { for(int j=0;j<4;j++) { int x=i+l,y=j+u; if(g[i+l][j+u]=='0') { cnt2++; } } } if(cnt1==4&&cnt2==12) { st=true; } } } if(st) cout<<"Yes"<<endl; else cout<<"No"<<endl; } return 0; }
- 1
Information
- ID
- 2199
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 10
- Tags
- # Submissions
- 10
- Accepted
- 3
- Uploaded By