| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 341308 | A_D | Emacs (COCI20_emacs) | C++14 | 2 ms | 512 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.
/*
ID: antwand1
TASK: pprime
LANG: C++
*/
#include <bits/stdc++.h>
#define ll long long
#define int long long
#define du long double
#define F first
#define S second
#define FOR(a,b) for(int a=1;a<=b;a++)
#define FORl(a,b) for(a=1;a<=b;a++)
#define FOR0(a,b) for(int a=1;a<b;a++)
#define FORl0(a,b) for(a=0;a<b;a++)
using namespace std;
const int N=101;
char a[N][N];
bool vis[N][N];
int n,m;
int x[]={0,0,1,-1};
int y[]={1,-1,0,0};
bool ok(int i,int j)
{
    return vis[i][j]==0&&min(i,j)>=1&&j<=m&&i<=n&&a[i][j]=='*';
}
void dfs(int i,int j)
{
    vis[i][j]=1;
    for(int k=0;k<4;k++){
        if(ok(i+x[k],j+y[k]))dfs(i+x[k],j+y[k]);
    }
}
main()
{
    //freopen("pprime.in","r",stdin);freopen("pprime.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>a[i][j];
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(a[i][j]=='*'&&vis[i][j]==0){
                ans++;
                dfs(i,j);
            }
        }
    }
    cout<<ans<<endl;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
