-
Notifications
You must be signed in to change notification settings - Fork 0
/
loj1012.cpp
131 lines (102 loc) · 2.16 KB
/
loj1012.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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
using namespace std;
#include<iostream>
#include<queue>
#include<cstring>
#include<cstdio>
struct info
{
int x,y;
};
queue<info>Q;
char place[22][22];
int w,h,val[22][22];
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
bool validity(int x,int y)
{
if(x>=0&&x<h&&y>=0&&y<w&&place[x][y]=='.'&&val[x][y]==0)
return true;
return false;
}
int main()
{
int T,i,j,rx,ry,sx,sy,ans,Case=1;
scanf("%d",&T);
while(T--)
{
ans=0;
scanf("%d%d",&w,&h);
for(i=0;i<h;i++)
{
scanf("%s",place[i]);
}
info run,temp;
memset(val,0,sizeof(val));
while(!Q.empty())
Q.pop();
for(i=0;i<h;i++)
{
for(j=0;j<w;j++)
{
if(place[i][j]=='@')
{
sx=i;
sy=j;
}
}
}
temp.x = sx;
temp.y = sy;
Q.push(temp);
while(!Q.empty())
{
run = Q.front();
Q.pop();
for(i=0;i<4;i++)
{
rx = run.x+dx[i];
ry = run.y+dy[i];
if(validity(rx,ry))
{
temp.x=rx;
temp.y=ry;
val[rx][ry]=1;
ans++;
Q.push(temp);
}
}
}
printf("Case %d: %d\n",Case++,ans+1);
}
return 0;
}
/*shakil solution by dfs(recursively)
#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
char maze[22][22];
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
int count,row,col;
void dfs(int x,int y)
{ maze[x][y]='#';
for(int i=0;i<4;i++)
{ int nx=dx[i]+x;
int ny=dy[i]+y;
if(nx>=0 && ny>=0 && nx<row && ny<col && maze[nx][ny]=='.') { dfs(nx,ny);count++;}
}
}
int main()
{ int T;
cin>>T;
for(int tt=1;tt<=T;tt++)
{ count=1;
cin>>col>>row;
for(int i=0;i<row;i++) scanf("%s",maze[i]);
for(int i=0;i<row;i++)
for(int j=0;j<col;j++) if(maze[i][j]=='@') dfs(i,j);
printf("Case %d: %d\n",tt,count);
}
return 0;
}*/