训练场状态_在线评测动态 - C语言网 (dotcpp.com)
一个岛屿上下左右相连形成环:
其内部的岛屿视为它的子岛屿。
我们可以从岛的外部向八个方向搜索(上下左右,上左,下左,上右,下右),将搜索到的岛视为独立的岛屿,而子岛屿不会被搜索到。
下图这种情况没有形成环,海水趁虚而入:
题目中第二个样例如下:
先给每个岛屿打上标记。
再从起点出发,看能搜到几个岛屿。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define X 1e2
#define M ((ll) X)
#define N ((ll) X + 10)
#define L "%lld"
#define F first
#define S second
ll a1[N][N];
//ll ab[N][N];
int ax[] = {1, 0, -1, 0}, ay[] = {0, 1, 0, -1};
int bx[] = {1, 0, -1, 0, 1, 1, -1, -1}, by[] = {0, 1, 0, -1, 1, -1, 1, -1};
ll ct[N * 10];
ll k = 2;
ll n, m;
ll sum;
void Dfs(int x, int y) {
a1[x][y] = k;//给岛屿打标记 ,k从2开始
for (int i = 0; i <= 3; i ++) {
int e = x + ax[i], f = y + ay[i];
if (a1[e][f] == 1) {//该点为全新的岛屿
Dfs(e, f);
}
}
}
void Dfs2(int x, int y) {
a1[x][y] = -1;
for (int i = 0; i <= 7; i ++) {
int e = x + bx[i], f = y + by[i];
if (e >= 0 && f >= 0 && e <= n + 1 && f <= m + 1) {
if (a1[e][f] >= 2 && !ct[a1[e][f]]) {//该点有岛屿,且该岛屿未被搜到过
ct[a1[e][f]] = 1;
sum ++;
}
if (a1[e][f] == 0) {
Dfs2(e, f);
}
}
}
}
int main() {
ll t;
scanf(L, &t);
for (int u = 1; u <= t; u ++) {
memset(a1, 0, sizeof a1);
memset(ct, 0, sizeof ct);
k = 2;
sum = 0;
scanf(L L, &n, &m);
for (int i = 1; i <= n; i ++) {
string st;
cin >> st;
for (int j = 1; j <= m; j ++) {
a1[i][j] = st[j - 1] - '0';
}
}
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= m; j ++) {
if (a1[i][j] == 1) {
Dfs(i, j);
k ++;//新的标记
}
}
}
Dfs2(0, 0);
printf(L "\n", sum);
}
return 0;
}