# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
245878 |
2020-07-07T16:35:10 Z |
Ort |
Emacs (COCI20_emacs) |
C++11 |
|
5 ms |
512 KB |
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n, m, s;
string mt[101];
bool v[101][101];
void ff(int y, int x) {
if(y>=n || x>=m || y<0 || x<0 || v[y][x] || mt[y][x]=='.') return;
v[y][x] = 1;
ff(y+1,x); ff(y,x+1); ff(y-1,x); ff(y,x-1);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n >> m;
for(int i=0;i<n;i++) cin >> mt[i];
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
if(!v[i][j] && mt[i][j]=='*') {
s++;
ff(i, j);
}
cout << s;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
512 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
4 ms |
384 KB |
Output is correct |
5 |
Correct |
5 ms |
384 KB |
Output is correct |
6 |
Correct |
5 ms |
384 KB |
Output is correct |
7 |
Correct |
5 ms |
384 KB |
Output is correct |
8 |
Correct |
5 ms |
512 KB |
Output is correct |
9 |
Correct |
5 ms |
512 KB |
Output is correct |
10 |
Correct |
5 ms |
384 KB |
Output is correct |