Codeforces Round #817 (Div. 4)

Codeforces Round #817 (Div. 4) F.L-shapes

题目大意：

思路：
暴力搜索
先判断是否符合“L”形，再判断是否符合两个“L”形不相连，即：一个阴影块的周围应有且只有两个阴影块

AC代码：

#include<iostream>
#include<string.h>
using namespace std;
int n,m;
char mp[100][100];
int dx[8]={1,1,0,-1,-1,-1,0,1};//从右开始
int dy[8]={0,-1,-1,-1,0,1,1,1};
int cx[4]={1,0,-1,0};
int cy[4]={0,-1,0,1};
bool check(int x,int y){
	if(mp[x+1][y]=='*')
		if(mp[x+1][y-1]=='*'||mp[x+1][y+1]=='*'||mp[x][y-1]=='*'||mp[x][y+1]=='*')
			return true;
	if(mp[x][y+1]=='*')
			if(mp[x+1][y]=='*'||mp[x+1][y+1]=='*'||mp[x-1][y]=='*'||mp[x-1][y+1]=='*')
				return true;
 	if(mp[x-1][y]=='*')
		if(mp[x-1][y-1]=='*'||mp[x-1][y+1]=='*'||mp[x][y-1]=='*'||mp[x][y+1]=='*')
			return true;
	
	if(mp[x][y-1]=='*')
		if(mp[x-1][y-1]=='*'||mp[x-1][y]=='*'||mp[x+1][y-1]=='*'||mp[x+1][y]=='*')
			return true;
	return false;
}
void solve(){
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(mp[i][j]=='*'){
				int cnt=1;
				for(int k=0;k<=7;k++)
					if(mp[i+dx[k]][j+dy[k]]=='*')
						cnt++;
				if(cnt!=3||check(i,j)==false){
					printf("NO\n");
					return;
				}
			}
	printf("YES\n");
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
    	memset(mp,'.',sizeof(mp));
		scanf("%d%d",&n,&m);
		for(int i=1;i<=n;i++)
			for(int j=1;j<=m;j++)
				cin>>mp[i][j];
		solve();
	}
    return 0;
}