题目大意:给一个图,图上有A,B,C三个小人,每移动一次,都是对三个小人进行同时移动,如果碰到'#',或者其他人的时候就自动不走。
思路:BFS求最短路,但是要同时记录三个人的状态,幸亏这道题的图只有10*10,3个人的状态也就10^6,不至于超内存,否则就要状态压缩了。
在我的思路里,BFS的时候判断不走的条件是:没有碰到'#‘,或者超出边界。所以会出现碰到其他人继续走的情况,wa了两次。后来我的想法就是:记录一下每个人在走每一步的时候是不是有移动了,然后如果移动过了,是不是会碰到其他人。这一步操作的判断需要做两次,因为可能出现这种情况:C已经走到墙边不能走,B在C的左边,A在B的左边。A先判断自己和B的值是否重合,因为B还没判断,所以A还是会重合到B,然后B判断会重合C,保持状态不动。在这种情况下,B的位置没有问题,但是A会和B重合,所以判断需要做两次。
代码效率49MS。
Code:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
int n;
char a[20][20];
struct node
{
int x, y;
}A, B, C;
struct status
{
int ax, ay, bx, by, cx, cy, ti;
};
int times[11][11][11][11][11][11];
int xx[4] = {1, 0, -1, 0};
int yy[4] = {0, 1, 0, -1};
bool isok(int x, int y)
{
return (x >= 0 && y >= 0 && x < n && y < n);
}
int bfs()
{
queue<status> q;
status top, tmp;
top.ax = A.x, top.ay = A.y, top.bx = B.x, top.by = B.y, top.cx = C.x, top.cy = C.y;
top.ti = 0;
q.push(top);
while(!q.empty())
{
int i;
top = q.front();
q.pop();
for(i = 0; i < 4; i ++)
{
int pax = xx[i] + top.ax;
int pay = yy[i] + top.ay;
int pbx = xx[i] + top.bx;
int pby = yy[i] + top.by;
int pcx = xx[i] + top.cx;
int pcy = yy[i] + top.cy;
bool oka = false, okb = false, okc = false;
if(!isok(pax, pay) || a[pax][pay] == '#')
{
pax = top.ax, pay = top.ay;
oka = true;
}
if(!isok(pbx, pby) || a[pbx][pby] == '#')
{
pbx = top.bx, pby = top.by;
okb = true;
}
if(!isok(pcx, pcy) || a[pcx][pcy] == '#')
{
pcx = top.cx, pcy = top.cy;
okc = true;
}
if((!oka && okc && pax == pcx && pay == pcy) || (!oka && okb && pax == pbx && pay == pby))
{
pax = top.ax, pay = top.ay;
oka = true;
}
if((!okb && okc && pbx == pcx && pby == pcy) || (oka && !okb && pax == pbx && pay == pby))
{
pbx = top.bx, pby = top.by;
okb = true;
}
if((oka && !okc && pax == pcx && pay == pcy) || (!okc && okb && pcx == pbx && pcy == pby))
{
pcx = top.cx, pcy = top.cy;
okc = true;
}
if((!oka && okc && pax == pcx && pay == pcy) || (!oka && okb && pax == pbx && pay == pby))
{
pax = top.ax, pay = top.ay;
oka = true;
}
if((!okb && okc && pbx == pcx && pby == pcy) || (oka && !okb && pax == pbx && pay == pby))
{
pbx = top.bx, pby = top.by;
okb = true;
}
if((oka && !okc && pax == pcx && pay == pcy) || (!okc && okb && pcx == pbx && pcy == pby))
{
pcx = top.cx, pcy = top.cy;
okc = true;
}
if(times[pax][pay][pbx][pby][pcx][pcy] == 0 || times[pax][pay][pbx][pby][pcx][pcy] > top.ti + 1)
{
times[pax][pay][pbx][pby][pcx][pcy] = tmp.ti = top.ti + 1;
tmp.ax = pax, tmp.ay = pay, tmp.bx = pbx, tmp.by = pby, tmp.cx = pcx, tmp.cy = pcy;
q.push(tmp);
if(a[pax][pay] == 'X' && a[pbx][pby] == 'X' && a[pcx][pcy] == 'X') //&& (!(pax == pbx && pay == pby) && !(pax == pcx && pay == pcy) && !(pcx == pbx && pcy == pby)))
{
// cout << pax << " " << pay << " " << pbx << " " << pby << " " << pcx << " " << pcy << endl;
return tmp.ti;
}
}
}
}
return -1;
}
int main()
{
int cse, t = 1, i, j;
scanf("%d", &cse);
while(cse --)
{
scanf("%d", &n);
for(i = 0; i < n; i ++)
scanf("%s", a[i]);
for(i = 0; i < n; i ++)
for(j = 0; j < n; j ++)
if(a[i][j] == 'A')
A.x = i, A.y = j;
else if(a[i][j] == 'B')
B.x = i, B.y = j;
else if(a[i][j] == 'C')
C.x = i, C.y = j;
memset(times, 0, sizeof(times));
int ans = bfs();
printf("Case %d: ", t ++);
if(ans != -1)
printf("%d\n", ans);
else
printf("trapped\n");
}
}