oj.uz

Submission #246729

# Submission time Handle Problem Language Result Execution time Memory
246729 2020-07-10T03:35:38 Z quadraticreciprocity Emacs (COCI20_emacs) C++14
50 / 50
 7 ms 1024 KB 
#include<bits/stdc++.h>
using namespace std;
using ll=long long;
char board[3000][3000];
ll n, k;
bool visited[3000][3000];
void dfs(ll x, ll y){
    if(x<1 or x>n or y<1 or y>k or visited[x][y] or board[x][y]!='*'){
        return;
    }
    visited[x][y]=1;
    dfs(x+1, y);
    dfs(x, y-1);
    dfs(x-1, y);
    dfs(x, y+1);
}
int main(){
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            cin>>board[i][j];
        }
    }
    ll answer=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=k;j++){
            if(!visited[i][j] && board[i][j]=='*'){
                ++answer;dfs(i, j);
            }
        }
    }
    cout<<answer<<'\n';
}

Subtask #1
50.0 / 50.0

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