題目描述
機器人移動學會（RMI）現在正嘗試用機器人搬運物品。機器人的形狀是一個直徑1.6米的球。在試驗階段，機器人被用於在一個儲藏室中搬運貨物。儲藏室是一個N*M的網格，有些格子爲不可移動的障礙。機器人的中心總是在格點上，當然，機器人必須在最短的時間內把物品搬運到指定的地方。機器人接受的指令有：向前移動1步（Creep）；向前移動2步（Walk）；向前移動3步（Run）；向左轉（Left）；向右轉（Right）。每個指令所需要的時間爲1秒。請你計算一下機器人完成任務所需的最少時間。
輸入輸出格式
輸入格式：輸入的第一行爲兩個正整數N,M（N,M<=50），下面N行是儲藏室的構造，0表示無障礙，1表示有障礙，數字之間用一個空格隔開。接着一行有四個整數和一個大寫字母，分別爲起始點和目標點左上角網格的行與列，起始時的面對方向（東E，南S，西W，北N），數與數，數與字母之間均用一個空格隔開。終點的面向方向是任意的。
輸出格式：一個整數，表示機器人完成任務所需的最少時間。如果無法到達，輸出-1。
輸入輸出樣例
廣搜吧，但我思路簡單，代碼複雜度挺大的，紀念人生第一道碼農題
把轉身和走合併起來算兩次時間，同理向後走算作三次時間
#include<bits/stdc++.h>
using namespace std;
queue <int> qx,qy;
queue <char> fx;
int n,m;
int qxx,qyy,zx,zy;
int s[550][550];
int ans[550][550];
char p;
bool check(int x,int y) {
if(x>=1&&y>=1&&x<n&&y<m)
return 1;
return 0;
}
int main() {
scanf("%d%d",&n,&m);
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++) {
scanf("%d",&s[i][j]);
if(s[i][j]==1)
s[i-1][j]=s[i][j-1]=s[i-1][j-1]=1;
}
for(int i=0; i<=n; i++)
for(int j=0; j<=m; j++)
ans[i][j]=20021109;
scanf("%d%d%d%d",&qxx,&qyy,&zx,&zy);
cin>>p;
qx.push(qxx),qy.push(qyy),fx.push(p);
ans[qxx][qyy]=0;
while(!qx.empty()) {
int x=qx.front(),y=qy.front();
char pos=fx.front();
qx.pop(),qy.pop(),fx.pop();
if(pos=='S') {
if(check(x+1,y))
if(ans[x][y]+1<=ans[x+1][y] &&s[x+1][y]==0) {
ans[x+1][y]=ans[x][y]+1;
qx.push(x+1);
qy.push(y);
fx.push('S');
}
if(check(x+2,y))
if(ans[x][y]+1<=ans[x+2][y] &&s[x+1][y]==0 && s[x+2][y]==0) {
ans[x+2][y]=ans[x][y]+1;
qx.push(x+2);
qy.push(y);
fx.push('S');
}
if(check(x+3,y))
if(ans[x][y]+1<=ans[x+3][y] &&s[x+1][y]==0 && s[x+2][y]==0 &&s[x+3][y]==0) {
ans[x+3][y]=ans[x][y]+1;
qx.push(x+3);
qy.push(y);
fx.push('S');
}
if(check(x,y+1))
if(ans[x][y]+2<=ans[x][y+1] &&s[x][y+1]==0) {
ans[x][y+1]=ans[x][y]+2;
qx.push(x);
qy.push(y+1);
fx.push('E');
}
if(check(x,y+2))
if(ans[x][y]+2<=ans[x][y+2] &&s[x][y+1]==0 && s[x][y+2]==0) {
ans[x][y+2]=ans[x][y]+2;
qx.push(x);
qy.push(y+2);
fx.push('E');
}
if(check(x,y+3))
if(ans[x][y]+2<=ans[x][y+3] &&s[x][y+1]==0 && s[x][y+2]==0 &&s[x][y+3]==0) {
ans[x][y+3]=ans[x][y]+2;
qx.push(x);
qy.push(y+3);
fx.push('E');
}
if(check(x,y-1))
if(ans[x][y]+2<=ans[x][y-1] &&s[x][y-1]==0) {
ans[x][y-1]=ans[x][y]+2;
qx.push(x);
qy.push(y-1);
fx.push('W');
}
if(check(x,y-2))
if(ans[x][y]+2<=ans[x][y-2] &&s[x][y-1]==0 && s[x][y-2]==0) {
ans[x][y-2]=ans[x][y]+2;
qx.push(x);
qy.push(y-2);
fx.push('W');
}
if(check(x,y-3))
if(ans[x][y]+2<=ans[x][y-3] &&s[x][y-1]==0 && s[x][y-2]==0 &&s[x][y-3]==0) {
ans[x][y-3]=ans[x][y]+2;
qx.push(x);
qy.push(y-3);
fx.push('W');
}
if(check(x-1,y))
if(ans[x][y]+3<=ans[x-1][y] &&s[x-1][y]==0) {
ans[x-1][y]=ans[x][y]+3;
qx.push(x-1);
qy.push(y);
fx.push('N');
}
if(check(x-2,y))
if(ans[x][y]+3<=ans[x-2][y] &&s[x-1][y]==0 && s[x-2][y]==0) {
ans[x-2][y]=ans[x][y]+3;
qx.push(x-2);
qy.push(y);
fx.push('N');
}
if(check(x-3,y))
if(ans[x][y]+3<=ans[x-3][y] &&s[x-1][y]==0 && s[x-2][y]==0 &&s[x-3][y]==0) {
ans[x-3][y]=ans[x][y]+3;
qx.push(x-3);
qy.push(y);
fx.push('N');
}
}
if(pos=='N') {
if(check(x-1,y))
if(ans[x][y]+1<=ans[x-1][y] &&s[x-1][y]==0) {
ans[x-1][y]=ans[x][y]+1;
qx.push(x-1);
qy.push(y);
fx.push('N');
}
if(check(x-2,y))
if(ans[x][y]+1<=ans[x-2][y] &&s[x-1][y]==0 && s[x-2][y]==0) {
ans[x-2][y]=ans[x][y]+1;
qx.push(x-2);
qy.push(y);
fx.push('N');
}
if(check(x-3,y))
if(ans[x][y]+1<=ans[x-3][y] &&s[x-1][y]==0 && s[x-2][y]==0 &&s[x-3][y]==0) {
ans[x-3][y]=ans[x][y]+1;
qx.push(x-3);
qy.push(y);
fx.push('N');
}
if(check(x,y+1))
if(ans[x][y]+2<=ans[x][y+1] &&s[x][y+1]==0) {
ans[x][y+1]=ans[x][y]+2;
qx.push(x);
qy.push(y+1);
fx.push('E');
}
if(check(x,y+2))
if(ans[x][y]+2<=ans[x][y+2] &&s[x][y+1]==0 && s[x][y+2]==0) {
ans[x][y+2]=ans[x][y]+2;
qx.push(x);
qy.push(y+2);
fx.push('E');
}
if(check(x,y+3))
if(ans[x][y]+2<=ans[x][y+3] &&s[x][y+1]==0 && s[x][y+2]==0 &&s[x][y+3]==0) {
ans[x][y+3]=ans[x][y]+2;
qx.push(x);
qy.push(y+3);
fx.push('E');
}
if(check(x,y-1))
if(ans[x][y]+2<=ans[x][y-1] &&s[x][y-1]==0) {
ans[x][y-1]=ans[x][y]+2;
qx.push(x);
qy.push(y-1);
fx.push('W');
}
if(check(x,y-2))
if(ans[x][y]+2<=ans[x][y-2] &&s[x][y-1]==0 && s[x][y-2]==0) {
ans[x][y-2]=ans[x][y]+2;
qx.push(x);
qy.push(y-2);
fx.push('W');
}
if(check(x,y-3))
if(ans[x][y]+2<=ans[x][y-3] &&s[x][y-1]==0 && s[x][y-2]==0 &&s[x][y-3]==0) {
ans[x][y-3]=ans[x][y]+2;
qx.push(x);
qy.push(y-3);
fx.push('W');
}
if(check(x+1,y))
if(ans[x][y]+3<=ans[x+1][y] &&s[x+1][y]==0) {
ans[x+1][y]=ans[x][y]+3;
qx.push(x+1);
qy.push(y);
fx.push('S');
}
if(check(x+2,y))
if(ans[x][y]+3<=ans[x+2][y] &&s[x+1][y]==0 && s[x+2][y]==0) {
ans[x+2][y]=ans[x][y]+3;
qx.push(x+2);
qy.push(y);
fx.push('S');
}
if(check(x+3,y))
if(ans[x][y]+3<=ans[x+3][y] &&s[x+1][y]==0 && s[x+2][y]==0 &&s[x+3][y]==0) {
ans[x+3][y]=ans[x][y]+3;
qx.push(x+3);
qy.push(y);
fx.push('S');
}
}
if(pos=='E') {
if(check(x,y+1))
if(ans[x][y]+1<=ans[x][y+1] &&s[x][y+1]==0) {
ans[x][y+1]=ans[x][y]+1;
qx.push(x);
qy.push(y+1);
fx.push('E');
}
if(check(x,y+2))
if(ans[x][y]+1<=ans[x][y+2] &&s[x][y+1]==0 && s[x][y+2]==0) {
ans[x][y+2]=ans[x][y]+1;
qx.push(x);
qy.push(y+2);
fx.push('E');
}
if(check(x,y+3))
if(ans[x][y]+1<=ans[x][y+3] &&s[x][y+3]==0 && s[x][y+2]==0 &&s[x][y+1]==0) {
ans[x][y+3]=ans[x][y]+1;
qx.push(x);
qy.push(y+3);
fx.push('E');
}
if(check(x-1,y))
if(ans[x][y]+2<=ans[x-1][y] &&s[x-1][y]==0) {
ans[x-1][y]=ans[x][y]+2;
qx.push(x-1);
qy.push(y);
fx.push('N');
}
if(check(x-2,y));
if(ans[x][y]+2<=ans[x-2][y] &&s[x-1][y]==0 && s[x-2][y]==0) {
ans[x-2][y]=ans[x][y]+2;
qx.push(x-2);
qy.push(y);
fx.push('N');
}
if(check(x-3,y))
if(ans[x][y]+2<=ans[x-3][y] &&s[x-1][y]==0 && s[x-2][y]==0 &&s[x-3][y]==0) {
ans[x-3][y]=ans[x][y]+2;
qx.push(x-3);
qy.push(y);
fx.push('N');
}
if(check(x+1,y))
if(ans[x][y]+2<=ans[x+1][y] &&s[x+1][y]==0) {
ans[x+1][y]=ans[x][y]+2;
qx.push(x+1);
qy.push(y);
fx.push('S');
}
if(check(x+2,y));
if(ans[x][y]+2<=ans[x+2][y] &&s[x+1][y]==0 && s[x+2][y]==0) {
ans[x+2][y]=ans[x][y]+2;
qx.push(x+2);
qy.push(y);
fx.push('S');
}
if(check(x+3,y))
if(ans[x][y]+2<=ans[x+3][y] &&s[x+1][y]==0 && s[x+2][y]==0 &&s[x+3][y]==0) {
ans[x+3][y]=ans[x][y]+2;
qx.push(x+3);
qy.push(y);
fx.push('S');
}
if(check(x,y-1))
if(ans[x][y]+3<=ans[x][y-1] &&s[x][y-1]==0) {
ans[x][y-1]=ans[x][y]+3;
qx.push(x);
qy.push(y-1);
fx.push('W');
}
if(check(x,y-2))
if(ans[x][y]+3<=ans[x][y-2] &&s[x][y-1]==0 && s[x][y-2]==0) {
ans[x][y-2]=ans[x][y]+3;
qx.push(x);
qy.push(y-2);
fx.push('W');
}
if(check(x,y-3))
if(ans[x][y]+3<=ans[x][y-3] &&s[x][y-1]==0 && s[x][y-2]==0 &&s[x][y-3]==0) {
ans[x][y-3]=ans[x][y]+3;
qx.push(x);
qy.push(y-3);
fx.push('W');
}
}
if(pos=='W') {
if(check(x,y-1))
if(ans[x][y]+1<=ans[x][y-1] &&s[x][y-1]==0) {
ans[x][y-1]=ans[x][y]+1;
qx.push(x);
qy.push(y-1);
fx.push('W');
}
if(check(x,y-2))
if(ans[x][y]+1<=ans[x][y-2] &&s[x][y-1]==0 && s[x][y-2]==0) {
ans[x][y-2]=ans[x][y]+1;
qx.push(x);
qy.push(y-2);
fx.push('W');
}
if(check(x,y-3))
if(ans[x][y]+1<=ans[x][y-3] &&s[x][y-1]==0 && s[x][y-2]==0 &&s[x][y-3]==0) {
ans[x][y-3]=ans[x][y]+1;
qx.push(x);
qy.push(y-3);
fx.push('W');
}
if(check(x-1,y))
if(ans[x][y]+2<=ans[x-1][y] &&s[x-1][y]==0) {
ans[x-1][y]=ans[x][y]+2;
qx.push(x-1);
qy.push(y);
fx.push('N');
}
if(check(x-2,y))
if(ans[x][y]+2<=ans[x-2][y] &&s[x-1][y]==0 && s[x-2][y]==0) {
ans[x-2][y]=ans[x][y]+2;
qx.push(x-2);
qy.push(y);
fx.push('N');
}
if(check(x-3,y))
if(ans[x][y]+2<=ans[x-3][y] &&s[x-1][y]==0 && s[x-2][y]==0 &&s[x-3][y]==0) {
ans[x-3][y]=ans[x][y]+2;
qx.push(x-3);
qy.push(y);
fx.push('N');
}
if(check(x+1,y))
if(ans[x][y]+2<=ans[x+1][y] &&s[x+1][y]==0) {
ans[x+1][y]=ans[x][y]+2;
qx.push(x+1);
qy.push(y);
fx.push('S');
}
if(check(x+2,y))
if(ans[x][y]+2<=ans[x+2][y] &&s[x+1][y]==0 && s[x+2][y]==0) {
ans[x+2][y]=ans[x][y]+2;
qx.push(x+2);
qy.push(y);
fx.push('S');
}
if(check(x+3,y))
if(ans[x][y]+2<=ans[x+3][y] &&s[x+1][y]==0 && s[x+2][y]==0 &&s[x+3][y]==0) {
ans[x+3][y]=ans[x][y]+2;
qx.push(x+3);
qy.push(y);
fx.push('S');
}
if(check(x,y+1))
if(ans[x][y]+3<=ans[x][y+1] &&s[x][y+1]==0) {
ans[x][y+1]=ans[x][y]+3;
qx.push(x);
qy.push(y+1);
fx.push('E');
}
if(check(x,y+2))
if(ans[x][y]+3<=ans[x][y+2] &&s[x][y+1]==0 && s[x][y+2]==0) {
ans[x][y+2]=ans[x][y]+3;
qx.push(x);
qy.push(y+2);
fx.push('E');
}
if(check(x,y+3))
if(ans[x][y]+3<=ans[x][y+3] &&s[x][y+3]==0 && s[x][y+2]==0 &&s[x][y+1]==0) {
ans[x][y+3]=ans[x][y]+3;
qx.push(x);
qy.push(y+3);
fx.push('E');
}
}
if(ans[zx][zy]!=20021109) {
printf("%d",ans[zx][zy]);
return 0;
}
}
printf("-1");
return 0;
}