| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 868872 |
2023-11-02T09:58:10 Z |
pcc |
Emacs (COCI20_emacs) |
C++14 |
|
0 ms |
464 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const int mxn = 110;
string arr[mxn];
pii dir[] = {{0,1},{0,-1},{1,0},{-1,0}};
int n,m;
int dfs(int r,int c){
arr[r][c] = '.';
for(auto &d:dir){
pii nxt = {r+d.fs,c+d.sc};
if(nxt.fs<0||nxt.sc<0||nxt.fs>=n||nxt.sc>=m||arr[nxt.fs][nxt.sc] == '.')continue;
dfs(nxt.fs,nxt.sc);
}
return 1;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>n>>m;
for(int i = 0;i<n;i++)cin>>arr[i];
int ans = 0;
for(int i = 0;i<n;i++){
for(int j = 0;j<m;j++){
if(arr[i][j] == '*')ans+=dfs(i,j);
}
}
cout<<ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
0 ms |
464 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
