-
Notifications
You must be signed in to change notification settings - Fork 7
/
LightOj 1055.cpp
362 lines (306 loc) · 8.54 KB
/
LightOj 1055.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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
/*
Problem name : 1055 - Going Together
Algorithm : BFS
Contest/Practice : Off Line Practice
Source : Light Oj
Comment : Whenever you start to believe yourself, people also start to believe in you
Date : 17-May-15
Last Update : 25-Mar-2015
*/
#include<bits/stdc++.h>
#define pause system("pause");
#define FOR(s,e,inc) for(int i=s;i<=e;i+=inc)
#define mod 1000000007
#define inf 1<<30
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define F first
#define S second
#define sz(x) ((int)x.size())
#define sqr(x) ( (x)* (x) )
#define eps 1e-9
#define lcm(x,y) (abs(x) /gcd(x,y))* abs(y)
#define on(x,w) x|(1<<w)
#define check(x,w) (x&(1<<w))
#define all(x) (x).begin(),(x).end()
#define pf printf
#define pi acos(-1.0)
#define reset(x,v) memset(x,v,sizeof(x));
#define AND &&
#define OR ||
#define what_is(x) cerr<<#x<<" is "<<x<<"\n";
typedef long long ll;
typedef unsigned long long llu;
using namespace std;
template<class T>
inline T mod_v(T num)
{
if(num>=0)
return num%mod;
else
return (num%mod+mod)%mod;
}
template<class T>
inline T gcd(T a,T b)
{
a=abs(a);
b=abs(b);
while(b)
{
a=a%b;
swap(a,b);
}
return a;
}
template<class T>
T fast_pow(T n , T p)
{
if(p==0) return 1;
if(p%2)
{
T g=mod_v ( mod_v(n) * mod_v(fast_pow(n,p-1)) );
return g;
}
else
{
T g=fast_pow(n,p/2);
g=mod_v( mod_v(g) * mod_v(g) ) ;
return g;
}
}
template<class T>
inline T modInverse(T n)
{
return fast_pow(n,mod-2);
}
template<class T>
inline void debug(string S1,T S2,string S3)
{
cout<<S1<<S2<<S3;
}
bool equalTo ( double a, double b ){ if ( fabs ( a - b ) <= eps ) return true; else return false; }
bool notEqual ( double a, double b ){if ( fabs ( a - b ) > eps ) return true; else return false; }
bool lessThan ( double a, double b ){ if ( a + eps < b ) return true; else return false; }
bool lessThanEqual ( double a, double b ){if ( a < b + eps ) return true; else return false;}
bool greaterThan ( double a, double b ){if ( a > b + eps ) return true;else return false;}
bool greaterThanEqual ( double a, double b ){if ( a + eps > b ) return true;else return false;}
template<class T>
inline T in()
{
register char c=0;
register T num=0;
bool n=false;
while(c<33)c=getchar();
while(c>33){
if(c=='-')
n=true;
else num=num*10+c-'0';
c=getchar();
}
return n?-num:num;
}
/******* ! Code start from here ! *******/
class nod
{
public:
int x1,x2,x3,y1,y2,y3;
nod()
{
}
nod(int x1,int x2,int x3,int y1,int y2,int y3)
{
this->x1=x1;
this->x2=x2;
this->x3=x3;
this->y1=y1;
this->y2=y2;
this->y3=y3;
}
};
int visit[12][12][12][12][12][12];
char g[12][12];
int x[]={1,0,-1,-0};
int y[]={0,1,-0,-1};
bool chk(int x1,int x2,int x3,int y1,int y2,int y3)
{
if(g[x1][y1]=='X' && g[x2][y2]=='X' && g[x3][y3]=='X' )
return true;
return false;
}
int main()
{
// std::ios_base::sync_with_stdio(false);
#ifdef kimbbakar
// freopen ( "in.txt", "r", stdin );
// freopen ( "out.txt", "w", stdout );
#endif
int t=in<int>(),tcase=1;
int n;
nod st,ds;
int x1,x2,x3,y1,y2,y3;
bool ok;
while(t--)
{
n=in<int>();
int c=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
scanf(" %c",&g[i][j] );
if(g[i][j]=='A')
{
st.x1=i;
st.y1=j;
}
else if(g[i][j]=='B')
{
st.x2=i;
st.y2=j;
}
else if(g[i][j]=='C')
{
st.x3=i;
st.y3=j;
}
else if(g[i][j]=='X')
{
if(c==0)
{
ds.x1=i;
ds.x1=j;
}
else if(c==1)
{
ds.x2=i;
ds.x2=j;
}
else if(c==3)
{
ds.x3=i;
ds.x3=j;
}
c++;
}
}
}
queue<nod>q;
ok=false;
reset(visit,0);
visit[st.x1][st.y1][st.x2][st.y2][st.x3][st.y3]=1;
q.push(st);
int res=0;
//nod nw=q.front();
// printf("nw = %d %d %d %d %d %d\n",nw.x1,nw.y1,nw.x2,nw.y2,nw.x3,nw.y3);
while(!q.empty() && !ok)
{
nod nw=q.front();
q.pop();
// printf("nw = %d %d %d %d %d %d\n",nw.x1,nw.y1,nw.x2,nw.y2,nw.x3,nw.y3);
for(int i=0;i<4 && !ok;i++)
{
x1=nw.x1+x[i];
y1=nw.y1+y[i];
x2=nw.x2+x[i];
y2=nw.y2+y[i];
x3=nw.x3+x[i];
y3=nw.y3+y[i];
// printf("k2 = %d %d %d %d %d %d\n",x1,y1,x2,y2,x3,y3);
if( (x1<1 || y1<1 || x1>n || y1>n) || (g[x1][y1]=='#' && x1>=1 && y1>=1 && x1<=n && y1<=n) )
{
x1=nw.x1;
y1=nw.y1;
//printf("hi %d %d %d %c %d\n",n,x1,y1,g[x1][y1],(x1<1 || y1<1 || x1>n || y1>n) || (g[x1][y1]=='#' && x1>=1 && y1>=1 && x1<=n && y1<=n));
if(x2==x1 && y2==y1)
{
x2=nw.x2;
y2=nw.y2;
if(x3==x2 && y3==y2)
{
x3=nw.x3;
y3=nw.y3;
}
}
if(x3==x1 && y3==y1)
{
x3=nw.x3;
y3=nw.y3;
if(x2==x3 && y2==y3)
{
x2=nw.x2;
y2=nw.y2;
}
}
}
if(x2<1 || y2<1 || x2>n || y2>n || (g[x2][y2]=='#' && x2>=1 && y2>=1 && x2<=n && y2<=n) )
{
x2=nw.x2;
y2=nw.y2;
if(x1==x2 && y1==y2)
{
x1=nw.x1;
y1=nw.y1;
if(x3==x1 && y3==y1)
{
x3=nw.x3;
y3=nw.y3;
}
}
if(x3==x2 && y3==y2)
{
x3=nw.x3;
y3=nw.y3;
if(x1==x3 && y1==y3)
{
x1=nw.x1;
y1=nw.y1;
}
}
}
if(x3<1 || y3<1 || x3>n || y3>n || (g[x3][y3]=='#' && x3>=1 && y3>=1 && x3<=n && y3<=n) )
{
x3=nw.x3;
y3=nw.y3;
if(x1==x3 && y1==y3)
{
x1=nw.x1;
y1=nw.y1;
if(x2==x1 && y2==y1)
{
x2=nw.x2;
y2=nw.y2;
}
}
if(x2==x3 && y2==y3)
{
x2=nw.x2;
y2=nw.y2;
if(x1==x2 && y1==y2)
{
x1=nw.x1;
y1=nw.y1;
}
}
}
// printf("k = %d %d %d %d %d %d\n",x1,y1,x2,y2,x3,y3);
if(chk(x1,x2,x3,y1,y2,y3))
{
res = visit[nw.x1][nw.y1][nw.x2][nw.y2][nw.x3][nw.y3] ;
ok=true;
break;
}
else if(!visit[x1][y1][x2][y2][x3][y3] )
{//printf("Im ok\n");
visit[x1][y1][x2][y2][x3][y3] = 1+visit[nw.x1][nw.y1][nw.x2][nw.y2][nw.x3][nw.y3] ;
q.push( nod(x1,x2,x3,y1,y2,y3));
}
}
}
if(ok)
printf("Case %d: %d\n",tcase++,res);
else
printf("Case %d: trapped\n",tcase++);
}
return 0;
}