1 solutions
-
0
#include<bits/stdc++.h> using namespace std; const int N=1010; char a[N][N]; int main() { int n; cin>>n; bool ans=false; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { cin>>a[i][j]; } } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(i+5<=n) { int cnt=0; for(int k=0;k<6;k++) { if(a[i+k][j]=='#') cnt++; } if(cnt>=4) ans=true; } if(j+5<=n) { int cnt=0; for(int k=0;k<6;k++) { if(a[i][j+k]=='#') cnt++; } if(cnt>=4) ans=true; } if((i+5)<=n&&(j+5)<=n) { int cnt=0; for(int k=0;k<6;k++) { if(a[i+k][j+k]=='#') cnt++; } if(cnt>=4) ans=true; } if((i+5)<=n&&(j-5)>=1) { int cnt=0; for(int k=0;k<6;k++) { if(a[i+k][j-k]=='#') { cnt++; } } if(cnt>=4) ans=true; } } } if(ans) cout<<"Yes"; else cout<<"No"; return 0; }
- 1
Information
- ID
- 2471
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 3
- Tags
- (None)
- # Submissions
- 2
- Accepted
- 1
- Uploaded By