# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229233 | VEGAnn | Emacs (COCI20_emacs) | C++14 | 5 ms | 512 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 = 110;
char c[N][N];
int n, m, ans;
void dfs(int x, int y){
if (c[x][y] == '.') return;
c[x][y] = '.';
if (x > 0) dfs(x - 1, y);
if (x < n - 1) dfs(x + 1, y);
if (y < m - 1) dfs(x, y + 1);
if (y > 0) dfs(x, y - 1);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
// freopen("in.txt","r",stdin);
cin >> n >> m;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> c[i][j];
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
if (c[i][j] == '*') {
dfs(i, j);
ans++;
}
cout << ans;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |