# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
201859 | blacktulip | Emacs (COCI20_emacs) | C++14 | 7 ms | 1272 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;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t,vis[105][105];
int cev;
string s;
char c[105][105];
vector<int> v;
inline void dfs(int satir,int sutun){
if(satir>n || sutun>m || satir<1 || sutun<1)return ;
if(c[satir][sutun]=='.')return ;
if(vis[satir][sutun]==1)return ;
vis[satir][sutun]=1;
dfs(satir+1,sutun);
dfs(satir-1,sutun);
dfs(satir,sutun+1);
dfs(satir,sutun-1);
}
int main(void){
scanf("%d %d",&n,&m);
FOR{
for(int j=1;j<=m;j++){
scanf(" %c",&c[i][j]);
}
}
FOR{
for(int j=1;j<=m;j++){
if(vis[i][j]==1)continue;
if(c[i][j]=='.')continue;
dfs(i,j);
cev++;
}
}
printf("%d\n",cev);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |