oj.uz

Submission #291270

# Submission time Handle Problem Language Result Execution time Memory
291270 2020-09-05T03:16:54 Z penguinhacker Emacs (COCI20_emacs) C++17
50 / 50
 1 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ar array

const int dx[4]={1, 0, -1, 0}, dy[4]={0, 1, 0, -1};
int n, m;
string g[100];
bool vis[100][100];

bool ok(int i, int j) {return i>=0&&i<n&&j>=0&&j<m;}
void dfs(int i, int j) {
	vis[i][j]=1;
	for (int k=0; k<4; ++k) {
		int a=i+dx[k], b=j+dy[k];
		if (ok(a, b)&&!vis[a][b]&&g[a][b]=='*') dfs(a, b);
	}
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n >> m;
	for (int i=0; i<n; ++i) cin >> g[i];
	int ans=0;
	for (int i=0; i<n; ++i) for (int j=0; j<m; ++j) if (!vis[i][j]&&g[i][j]=='*') {
		++ans;
		dfs(i, j);
	}
	cout << ans << "\n";
	return 0;
}

Subtask #1
50.0 / 50.0

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