bfs-poj-Bloxorz I

存在的问题：用string 显示 runtime error 还有就是效率超低，1890ms险过，还是不够

#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;
int n,m;
struct node{
    int x,y,state;
    int step;
};
char mmap[505][505];
int used[505][505][10];
node en;
int dir[6][6][6]={  {{0,-2,1},{0,1,1},{1,0,2},{-2,0,2}},  {{0,2,-1},{0,-1,-1},{-1,0,0},{1,0,0}},    {{0,-1,0},{0,1,0},{-1,0,-2},{2,0,-2}}   };
bool can(int x,int y,int state){
    if(state==0)
        return x>=0&&x<n&&y>=0&&y<m&&mmap[x][y]!='#'&&mmap[x][y]!='E';
    else if(state==1)
        return x>=0&&x<n&&y>=0&&y+1<m&&mmap[x][y]!='#'&&mmap[x][y+1]!='#';
    else
        return x>=0&&x+1<n&&y>=0&&y<m&&mmap[x][y]!='#'&&mmap[x+1][y]!='#';
}
int bfs(int x,int y,int state,int step)
{
    queue<node> que;
    node p,now,next;
    p.x=x,p.y=y,p.state=state,p.step=step;
    que.push(p);
    while(!que.empty()){
        now=que.front();
        que.pop();
        if(now.x==en.x && now.y==en.y && now.state==0){
            return now.step;
        }
        for(int i=0;i<4;i++){
            int dx=now.x+dir[now.state][i][0];
            int dy=now.y+dir[now.state][i][1];
            int dstate=now.state+dir[now.state][i][2];
            if(can(dx,dy,dstate) && !used[dx][dy][dstate]){
                next.x=dx,next.y=dy,next.state=dstate,next.step=now.step+1;
                que.push(next);
                used[dx][dy][dstate]=1;
            }
        }
    }
    return -1;
}
int main()
{
    node start,may[4];
    while(scanf("%d%d",&n,&m) &&  (n!=0 && m!=0)){
        int counter=0;
        memset(used,0,sizeof(used));
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                    scanf(" %c",&mmap[i][j]);
                    if(mmap[i][j]=='X')may[counter].x=i,may[counter++].y=j;
                    if(mmap[i][j]=='O')en.x=i,en.y=j,en.state=0,en.step=0;
            }
        }
        if(counter==1) start.x=may[0].x,start.y=may[0].y,start.step=0,start.state=0;
        else{
            if(may[0].y==may[1].y) start.x=may[0].x,start.y=may[0].y,start.step=0,start.state=2;
            else start.x=may[0].x,start.y=may[0].y,start.step=0,start.state=1;
        }
        used[start.x][start.y][start.state]=1;
        int ans=bfs(start.x,start.y,start.state,start.step);
        if(ans==-1){
            printf("Impossible\n");
        }
        else printf("%d\n",ans);
    }
    return 0;
}

转载于:https://www.cnblogs.com/Scale-the-heights/p/4322361.html