oj.uz

Submission #732230

# Submission time Handle Problem Language Result Execution time Memory
732230 2023-04-28T18:36:50 Z vjudge1 Emacs (COCI20_emacs) C++17
50 / 50
 1 ms 468 KB 
#include<bits/stdc++.h>
#define int long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

using namespace std;

char arr[105][105];
int n,m,vis[105][105];

bool f(int a,int b){
	if(a<0 || a>=n || b<0 || b>=m)return false;
	if(vis[a][b])return false;
	if(arr[a][b]=='.')return false;
	return true;
}

void dfs(int x,int y){
	vis[x][y]=1;
	if(f(x-1,y))dfs(x-1,y);
	if(f(x+1,y))dfs(x+1,y);
	if(f(x,y-1))dfs(x,y-1);
	if(f(x,y+1))dfs(x,y+1);
	return;
}

int32_t main(){
	fast;
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cin>>arr[i][j];
		}
	}
	int ans=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			if(arr[i][j]=='.' || vis[i][j])continue;
			ans++;
			dfs(i,j);
		}
	}
	cout<<ans<<endl;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 340 KB Output is correct