# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1024037 |
2024-07-15T10:43:36 Z |
kustizus |
Emacs (COCI20_emacs) |
C++17 |
|
1 ms |
604 KB |
#include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll n,m,ans=0,x[101][101];
char a[101][101];
void Try(ll i, ll j){
x[i][j]=1;
if (a[i-1][j]=='*' && i>1 && x[i-1][j]==0) Try(i-1,j);
if (a[i+1][j]=='*' && i<n && x[i+1][j]==0) Try(i+1,j);
if (a[i][j-1]=='*' && j>1 && x[i][j-1]==0) Try(i,j-1);
if (a[i][j+1]=='*' && j<m && x[i][j+1]==0) Try(i,j+1);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>m;
for (ll i=1;i<=n;i++)
for (ll j=1;j<=m;j++){
cin>>a[i][j];
x[i][j]=0;
}
for (ll i=1;i<=n;i++)
for (ll j=1;j<=m;j++)
if (a[i][j]=='*' && x[i][j]==0){
ans++;
Try(i,j);
}
cout<<ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
604 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
468 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
604 KB |
Output is correct |
8 |
Correct |
1 ms |
604 KB |
Output is correct |
9 |
Correct |
1 ms |
604 KB |
Output is correct |
10 |
Correct |
1 ms |
604 KB |
Output is correct |