# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706598 | YugiHacker | Emacs (COCI20_emacs) | C++14 | 1 ms | 464 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>
#define el cout<<"\n"
#define f0(i,n) for(int i=0;i<n;++i)
#define f1(i,n) for(int i=1;i<=n;++i)
#define maxn 102
using namespace std;
int n, m, ans, d[maxn][maxn];
char a[maxn][maxn];
int x[] ={0, 0, 1, -1};
int y[] ={1, -1, 0, 0};
void dfs(int u, int v)
{
if (a[u][v] == '.' || d[u][v] || u < 1 || v<1 || u>n || v>m) return;
d[u][v] = 1;
f0 (i, 4) dfs(u+x[i], v+y[i]);
}
main()
{
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> m;
f1 (i, n) f1 (j, m) cin >> a[i][j];
f1 (i, n) f1 (j, m)
{
if (a[i][j] == '*' && d[i][j] == 0) dfs(i, j), ans++;
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |