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>
using namespace std;
typedef long long ll;
int w,h;
vector<vector<int>>grid(w,vector<int>(h));
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
vector<vector<int>>vis(w,vector<int>(h,0));
void dfs(int x,int y){
vis[x][y]=1;
for(int i=0;i<4;i++){
int nx=x+dx[i];
int ny=y+dy[i];
if(nx>=0 && nx<w && ny>=0 && ny<h &&!vis[nx][ny]&& grid[nx][ny]==grid[x][y]){
dfs(nx,ny);
}
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>w>>h;
for(int i=0;i<w;i++){
for(int j=0;j<h;j++){
char x;
cin>>x;
grid[i][j]=x;
}
}
int ans=0;
for(int j=0;j<w;j++){
for(int i=0;i<h;i++){
if(!vis[j][i] &&(grid[j][i]=='R'||grid[j][i]=='F')){
dfs(j,i);
ans++;
}
}
}
cout<<ans<<'\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |