CE的蒻求助
  • 板块P1331 海战
  • 楼主Li_Dao_Yuan
  • 当前回复2
  • 已保存回复2
  • 发布时间2022/7/27 16:23
  • 上次更新2023/10/27 18:09:29
查看原帖
CE的蒻求助
571556
Li_Dao_Yuan楼主2022/7/27 16:23
#include<bits/stdc++.h>
using namespace std;
int x,y,n,i,j;
char map[1145][4514];
void boat(char a[1145][4514],int i,int j){
	if(a[i][j+1]=='#'){
		a[i][j]='!';
		j++;
		boat(a[1145][4514],i,j);
	}
	else if(a[i][j-1]=='#'){
		a[i][j]='!';
		j--;
		boat(a[1145][4514],i,j);
	}
	else if(a[i+1][j]=='#'){
		a[i][j]='!';
		i++;
		boat(a[1145][4514],i,j);
	}
	else if(a[i-1][j]=='#'){
		a[i][j]='!';
		i--;
		boat(a[1145][4514],i,j);
	}
	else{
		a[i][j]='!';
		n++;
		return;
	}
}
int main(){
	//输入 
    scanf("%d%d",&x,&y);
	for(i=1;i<=y;i++){
		for(j=1;j<=x;j++){
			cin >> map[i][j];
		}
	}
	//判断合法 
    for(i=1;i<y;i++)
    	for(j=1;j<x;j++){
    		if(map[i][j]=='#'&&map[i][++j]=='#'&&map[++i][j]=='#'&&map[++i][++j]=='.'){
    			printf("Bad placement.");
    			return 0;
			}
			if(map[i][j]=='#'&&map[i][++j]=='#'&&map[++i][j]=='.'&&map[++i][++j]=='#'){
    			printf("Bad placement.");
    			return 0;
			}
			if(map[i][j]=='#'&&map[i][++j]=='.'&&map[++i][j]=='#'&&map[++i][++j]=='#'){
    			printf("Bad placement.");
    			return 0;
			}
			if(map[i][j]=='.'&&map[i][++j]=='#'&&map[++i][j]=='#'&&map[++i][++j]=='#'){
    			printf("Bad placement.");
    			return 0;
			}
		}
	int k,d;
	for(i=1;i<y;i++)
    	for(j=1;j<x;j++){
    		k=i;
    		d=j;
    		if (a[i][j]=='#') boat(a[1145][4514],i,j);
    		i=k;
    		j=d;
		}
	printf("There are %d ships.",n);
	return 0;
}
2022/7/27 16:23
加载中...