AcWing 1113. 红与黑
原题链接
简单
作者:
我是java同学
,
2023-02-06 08:38:24
,
所有人可见
,
阅读 111
#include <iostream>
#include <cstring>
using namespace std;
const int N = 25;
int n, m;
char g[N][N];
bool st[N][N];
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int dfs(int x, int y)
{
int cnt = 1;
st[x][y] = true;
for (int i = 0; i < 4; i ++ )
{
int a = x + dx[i], b = y + dy[i];
if (st[a][b]) continue;
if (a < 0 || a >= n || b < 0 || b > m) continue;
if (g[a][b] != '.') continue;
cnt += dfs(a, b);
}
return cnt;
}
int main()
{
while (cin >> m >> n, m || n)
{
for (int i = 0; i < n; i ++ ) cin >> g[i];
int x, y;
for (int i = 0; i < n; i ++ )
for (int j = 0 ; j < m; j ++ )
if (g[i][j] == '@')
{
x = i;
y = j;
}
memset(st, false, sizeof st);
cout << dfs(x, y) << endl;
}
return 0;
}