-
Notifications
You must be signed in to change notification settings - Fork 0
/
1012 - Guilty Prince.cpp
82 lines (72 loc) · 1.94 KB
/
1012 - Guilty Prince.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
#include<bits/stdc++.h>
#define max_index 20
using namespace std;
int n,m;
char graph[max_index][max_index];
int BFS(int x,int y){
bool visited[max_index][max_index];
queue<pair<int,int> >q;
int count = 1;
for(int i=0; i<max_index; i++){
for(int j=0; j<max_index; j++){
visited[i][j] = false;
}
}
visited[x][y] = true;
q.push(make_pair(x,y));
while(!q.empty()){
auto p = q.front();
q.pop();
for(int i= p.first; i<n; i++){
if(graph[i][p.second]=='#') break;
if(!visited[i][p.second]){
q.push(make_pair(i,p.second));
visited[i][p.second] = true;
count++;
}
}
for(int i= p.first; i>=0; i--){
if(graph[i][p.second]=='#') break;
if(!visited[i][p.second]){
q.push(make_pair(i,p.second));
visited[i][p.second] = true;
count++;
}
}
for(int i= p.second; i>=0; i--){
if(graph[p.first][i]=='#') break;
if(!visited[p.first][i]){
q.push(make_pair(p.first,i));
visited[p.first][i] = true;
count++;
}
}
for(int i= p.second; i<m; i++){
if(graph[p.first][i]=='#') break;
if(!visited[p.first][i]){
q.push(make_pair(p.first,i));
visited[p.first][i] = true;
count++;
}
}
}
return count;
}
int main()
{
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int t,i,j,x,y,que=1;
char c;
scanf("%d",&t);
while(t--){
scanf("%d%d",&m,&n);
for(i=0; i<n; i++){
for(j=0; j<m; j++){
scanf(" %c",&graph[i][j]);
if(graph[i][j]=='@'){ x=i;y=j;}
}
}
printf("Case %d: %d\n",que++,BFS(x,y));
}
}