# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
519850 | Hacv16 | Emacs (COCI20_emacs) | C++17 | 3 ms | 716 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>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX = 615;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int VAR[4] = {-1, 1, 0, 0};
#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define dbg(x) cout << #x << ": " << "[ " << x << " ]\n"
int n, m, ans;
char t[MAX][MAX];
void setIO(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void dfs(int x, int y){
t[x][y] = '.';
for(int i = 0, j = 3; i < 4; i++, j--){
int nx = x + VAR[i], ny = y + VAR[j];
if(t[nx][ny] == '*'){
dfs(nx, ny);
}
}
}
int main(){
setIO();
memset(t, '.', sizeof(t));
cin >> n >> m;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
cin >> t[i][j];
}
}
for(int i = 1; i <= n; i++){
for(int j = 1; j <= m; j++){
if(t[i][j] == '*'){
ans++, dfs(i, j);
}
}
}
cout << ans << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |