-
Notifications
You must be signed in to change notification settings - Fork 0
/
oildeposit.cpp
67 lines (56 loc) · 1.27 KB
/
oildeposit.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <cstring>
#include <map>
#include <sstream>
using namespace std;
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> pii;
char mp[105][105];
bool ch[105][105];
int dx[8]={0,0,1,-1,1,-1,-1,1};
int dy[8]={1,-1,0,0,1,-1,1,-1};
void dfs(int x,int y){
if(mp[x][y]=='@')
ch[x][y]=true;
else
return;
for(int i=0;i<8;i++){
if(mp[x+dx[i]][y+dy[i]] && !ch[x+dx[i]][y+dy[i]])
dfs(x+dx[i],y+dy[i]);
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
int m,n;
while(cin>>m>>n){
if(m==0&&n==0)
break;
memset(mp,'*',sizeof(mp));
memset(ch,false,sizeof(ch));
for(int i=1;i<=m;i++)
for(int j=1;j<=n;j++)
cin>>mp[i][j];
int ans=0;
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
if(mp[i][j]=='@'){
if(ch[i][j]==false){
dfs(i,j);
ans++;
}
}
}
}
cout<<ans<<'\n';
}
return 0;
}