思路1:
该题首先考虑DFS/BFS,统计船的数量并不难,典型的统计方案问题,难点在于判断图中是否存在非法的船,根据题意我们知道“船必须是方形的”,即船的形状必须是矩形
通过案例的模拟,我们不难发现实际上,如果出现非法船的情况,一定会出现如下结构
# # . # 或 # # # . 或 # . # # 或 . # # # 即在一个2*2的方格中有三个#。所以就能得出代码
#include<iostream>
#define MAX 1010
using namespace std;
int n, m;
char map[MAX][MAX];
bool visited[MAX][MAX];
int nextt1[4][2] = { {0,0},{0,1},{1,0},{1,1} };
int nextt2[4][2] = { {0,1},{1,0},{0,-1},{-1,0} };
bool check() {//检查图中是否存在非法的船,如果存在则返回true,反之返回false
for (int i = 0; i < n-1; i++) {//遍历图中每一个2*2的分块
for (int j = 0; j < m - 1; j++) {//如果分块中存在3个#则一定非法
int sum = 0;
for (int k = 0; k < 4; k++) {
int x = nextt1[k][0];
int y = nextt1[k][1];
if (map[i + x][j + y] == '#') {
sum++;
}
}
if (sum == 3) {
return true;
}
}
}
return false;
}
void dfs(int x,int y) {
if (map[x][y]=='#') {
visited[x][y] = 1;
for (int i = 0; i < 4; i++) {
int tx = x + nextt2[i][0];
int ty = y + nextt2[i][1];
if (tx < 0 || ty < 0 || tx == n || ty == m || visited[tx][ty]) {
continue;
}
dfs(tx, ty);
}
}
}
int main()
{
int ans = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> map[i][j];
}
}
if (check()) {//判断是否合法
cout << "Bad placement." << endl;
return 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (map[i][j] == '#'&&!visited[i][j]) {
dfs(i, j);//得到船的数量
ans++;
}
}
}
cout << "There are "<<ans<<" ships." << endl;
return 0;
}
思路2:
根据题意我们知道船的形状必须是矩形,那么我们可以求出每条船的“面积”,进而判断是否合法,即遍历整个图,如果遇到#,则向右扩张、向下扩张,得到该船的长和宽,进而得到面积,再dfs该条船得到船所含的#个数,如果该数量不等于上面得到的面积,则存在非法情况
#include<iostream>
#define MAX 1010
using namespace std;
int n, m, sum = 0;
char map[MAX][MAX];
bool visited[MAX][MAX];
int nextt2[4][2] = { {0,1},{1,0},{0,-1},{-1,0} };
void dfs(int x, int y) {
if (map[x][y] == '#') {
sum++;
visited[x][y] = 1;
for (int i = 0; i < 4; i++) {
int tx = x + nextt2[i][0];
int ty = y + nextt2[i][1];
if (tx < 0 || ty < 0 || tx == n || ty == m || visited[tx][ty]) {
continue;
}
dfs(tx, ty);
}
}
}
void getLengthAndWidth(int& length, int &width,int x,int y) {
for (int i = y; i < m; i++) {
if (map[x][i] == '#') {
length++;
}
else {
break;
}
}
for (int i = x; i < n; i++) {
if (map[i][y] == '#') {
width++;
}
else {
break;
}
}
}
int main()
{
int ans = 0;
cin >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> map[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (map[i][j] == '#' && !visited[i][j]) {
sum = 0;//统计该船#的数量
int length=0,width=0,area;
getLengthAndWidth(length,width,i,j);//得到长和宽
area = length * width;
dfs(i, j);
if (sum != area) {
cout << "Bad placement." << endl;
return 0;
}
ans++;
}
}
}
cout << "There are "<<ans<<" ships." << endl;
return 0;
}