Submission #246729

#TimeUsernameProblemLanguageResultExecution timeMemory
246729quadraticreciprocityEmacs (COCI20_emacs)C++14
50 / 50
7 ms1024 KiB
#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'; }
#Verdict Execution timeMemoryGrader output
Fetching results...