# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
838534 | EntityPlantt | Emacs (COCI20_emacs) | C++17 | 1 ms | 340 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 <cstdio>
short m, n, i, j, cnt;
bool r[100][100];
char c;
inline void clear(short x, short y) {
r[x][y] = false;
if (x && r[x - 1][y]) clear(x - 1, y);
if (y && r[x][y - 1]) clear(x, y - 1);
if (x < m - 1 && r[x + 1][y]) clear(x + 1, y);
if (y < n - 1 && r[x][y + 1]) clear(x, y + 1);
}
int main() {
scanf("%hd%hd", &m, &n);
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
scanf(" %c", &c);
r[i][j] = c == '*';
}
}
for (i = 0; i < m; i++) {
for (j = 0; j < n; j++) {
if (r[i][j]) {
cnt++;
clear(i, j);
}
}
}
printf("%hd", cnt);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |