# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
583179 | AGE | Emacs (COCI20_emacs) | C++14 | 22 ms | 31828 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 F first
#define S second
#define int long long
#define pb push_back
using namespace std;
const int N=1e6,M=2e3,mod=1e9+7;
int dp[2][51][51][10001];
string s[N];
int cnt=1;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,-1,1};
int n,m,vis[105][105];
bool inside(int x,int y){
return (x<n)&&(x>=0)&&(y<m)&&(y>=0)&&(s[x][y]=='*');
}
void floodfill(int x,int y){
vis[x][y]=1;
for(int i=0;i<4;i++){
int newx=x+dx[i];
int newy=y+dy[i];
if(inside(newx,newy)&&vis[newx][newy]==0)
floodfill(newx,newy);
}
}
main()
{
cin>>n>>m;
for(int i=0;i<n;i++)
cin>>s[i];
for(int i=0;i<n;i++)
for(int j=0;j<m;j++){
if(!vis[i][j]&&s[i][j]=='*')
floodfill(i,j),cnt++;
}
cout<<cnt-1<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |