# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
209980 | SamAnd | Emacs (COCI20_emacs) | C++17 | 5 ms | 404 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 102;
const int xx[4] = {0, 1, 0, -1};
const int yy[4] = {1, 0, -1, 0};
int n, m;
char a[N][N];
bool c[N][N];
void dfs(int x, int y)
{
if (c[x][y])
return;
c[x][y] = true;
for (int i = 0; i < 4; ++i)
{
int hx = x + xx[i];
int hy = y + yy[i];
if (hx >= 0 && hx < n && hy >= 0 && hy < m && a[hx][hy] == '*')
dfs(hx, hy);
}
}
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; ++i)
scanf(" %s", a[i]);
int ans = 0;
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < m; ++j)
{
if (a[i][j] == '*' && !c[i][j])
{
++ans;
dfs(i, j);
}
}
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |