-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1938.cpp
158 lines (149 loc) · 2.94 KB
/
1938.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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
#include <stdio.h>
#include <set>
#include <tuple>
#include <queue>
using namespace std;
queue<pair<tuple<int,int,int>,int > >q;
set<tuple<int,int,int> >s;
tuple<int,int,int> ans;
tuple<int,int,int> start;
int n;
char map[51][51];
void findB(){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(map[i][j]=='B'){
if(j+1<n&&map[i][j+1]=='B'){
get<0>(start)=i;
get<1>(start)=j+1;
get<2>(start)=0;
}else{
get<0>(start)=i+1;
get<1>(start)=j;
get<2>(start)=1;
}
return;
}
}
}
}
void findE(){
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(map[i][j]=='E'){
if(j+1<n&&map[i][j+1]=='E'){
get<0>(ans)=i;
get<1>(ans)=j+1;
get<2>(ans)=0;
}else{
get<0>(ans)=i+1;
get<1>(ans)=j;
get<2>(ans)=1;
}
return;
}
}
}
}
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
scanf(" %c",&map[i][j]);
}
}
findB();
findE();
// printf("%d %d %d\n\n",get<0>(ans),get<1>(ans),get<2>(ans));
q.push(make_pair(start,0));
while(!q.empty()){
if(q.front().first==ans){
printf("%d\n",q.front().second);
// printf("%d %d %d",get<0>(q.front().first),get<1>(q.front().first),get<2>(q.front().first));
return 0;
}
if(s.find(q.front().first)==s.end()){
s.insert(q.front().first);
int x = get<0>(q.front().first);
int y = get<1>(q.front().first);
int dir=get<2>(q.front().first);
int time = q.front().second;
// printf("%d %d %d %d\n",x,y,dir,time);
if(dir==0){
int tmp=0;
int tmp2=0;
if(x>0){
for(int i=y-1;i<=y+1;i++){
if(map[x-1][i]=='1'){
tmp++;
}
}
if(tmp==0){
q.push(make_pair(make_tuple(x-1,y,dir),time+1));
}
}else{
tmp=9;
}
if(x+1<n){
for(int i=y-1;i<=y+1;i++){
if(map[x+1][i]=='1'){
tmp2++;
}
}
if(tmp2==0){
q.push(make_pair(make_tuple(x+1,y,dir),time+1));
}
}else{
tmp2=9;
}
if(tmp==0&&tmp2==0){
q.push(make_pair(make_tuple(x,y,1),time+1));
}
if(y-2>=0&&map[x][y-2]!='1'){
q.push(make_pair(make_tuple(x,y-1,0),time+1));
}
if(y+2<n&&map[x][y+2]!='1'){
q.push(make_pair(make_tuple(x,y+1,0),time+1));
}
}else{
int tmp=0;
int tmp2=0;
if(y>0){
for(int i=x-1;i<=x+1;i++){
if(map[i][y-1]=='1'){
tmp++;
}
}
if(tmp==0){
q.push(make_pair(make_tuple(x,y-1,dir),time+1));
}
}else{
tmp=9;
}
if(y+1<n){
for(int i=x-1;i<=x+1;i++){
if(map[i][y+1]=='1'){
tmp2++;
}
}
if(tmp2==0){
q.push(make_pair(make_tuple(x,y+1,dir),time+1));
}
}else{
tmp2=9;
}
if(tmp==0&&tmp2==0){
q.push(make_pair(make_tuple(x,y,0),time+1));
}
if(x-2>=0&&map[x-2][y]!='1'){
q.push(make_pair(make_tuple(x-1,y,dir),time+1));
}
if(x+2<n&&map[x+2][y]!='1'){
q.push(make_pair(make_tuple(x+1,y,dir),time+1));
}
}
}
q.pop();
}
printf("0");
}