| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 246728 | quadraticreciprocity | Emacs (COCI20_emacs) | C++14 | 0 ms | 0 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;
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';
}
