Submission #519853

# Submission time Handle Problem Language Result Execution time Memory
519853 2022-01-27T12:36:23 Z Hacv16 Emacs (COCI20_emacs) C++17
50 / 50
2 ms 716 KB
#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); 
}

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;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 716 KB Output is correct
3 Correct 1 ms 696 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 684 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 716 KB Output is correct
8 Correct 1 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 1 ms 696 KB Output is correct