天塌了，只得54分啊

#include<iostream>
using namespace std;
int n,m,t,x1,y1,x2,y2,dx[4] = {0,1,0,-1},dy[4] = {1,0,-1,0},cnt = 0;
char map[1005][1005];
void dfs(int x,int y){
	map[x][y] = '.';
	for(int i = 0;i < 4;i++){
		int tx = x+dx[i];
		int ty = y+dy[i];
		if(tx >= 0 && tx < n && ty >= 0 && ty < m && map[tx][ty] != '.'){
			dfs(tx,ty);
		}
	}
}
int main(){
	cin >> n >> m;
	for(int i = 0;i < n;i++){
		cin >> map[i]; 
	}
	for(int i = 0;i < n;i++){
		for(int j = 0;j < m;j++){
			if(map[i][j] == '#'){
				cnt++;
				dfs(i,j);
			}
			
		}
	}
	if(cnt > 0){
		cout << "There are "<< cnt << " ships.";
	}else{
		cout << "Bad placement";
	}
	return 0;
}