zoj1649_Rescue

广度优先，关键是那个牛逼守卫，会消耗2单位时间，有可能会破坏广度树，

思路是停在那个守卫那里面一回合，

垃圾代码，消耗40MS

 

#include<iostream>#include<string.h>using namespace std;#define MAX 202struct node{int i;int j;};int dir[4][2]={{1,0},{0,1},{-1,0},{0,-1}};int martic[MAX][MAX];int mark[MAX][MAX];node queue[40004];int bfs(int x,int y,int a,int b){if(x==a&&y==b)return 0;node temp;int rear=-1,front=-1,i,j;temp.i=x;temp.j=y;queue[++rear]=temp;mark[temp.i][temp.j]=0;while(rear>front){temp=queue[++front];if(martic[temp.i][temp.j]==2){mark[temp.i][temp.j]++;martic[temp.i][temp.j]=1;queue[++rear].i=temp.i;queue[rear].j=temp.j;}else{for(int k=0;k<4;k++){i=temp.i+dir[k][0];j=temp.j+dir[k][1];if(i==a&&j==b){mark[i][j]=mark[temp.i][temp.j]+1;return mark[i][j];}else if(mark[i][j]==0 && martic[i][j]!=1){mark[i][j]=mark[temp.i][temp.j]+1;queue[++rear].i=i;queue[rear].j=j;}}}}return -1;}int main(){int N,M,i,j;int x,y,a,b,m;char ch;while(cin>>N>>M){memset(martic,0,sizeof(martic));memset(mark,0,sizeof(martic));for(i=0;i<=N+1;i++){martic[i][0]=1;martic[i][M+1]=1;}for(i=0;i<=M+1;i++){martic[0][i]=1;martic[N+1][i]=1;}for(i=1;i<=N;i++)for(j=1;j<=M;j++){cin>>ch;if(ch=='a'){ a=i;b=j; }if(ch=='r'){ x=i;y=j; }if(ch=='x'){ martic[i][j]=2; }if(ch=='.'){ martic[i][j]=0; }if(ch=='#'){ martic[i][j]=1; }}m=bfs(x,y,a,b);if(m==-1)cout<<"Poor ANGEL has to stay in the prison all his life."<<endl;elsecout<<m<<endl;}return 0;}/*7 8 #.#####. #.a#..r. #..#x... ..#..### #....#.. ..##.... ........ 5 2.a.x.x.x.r*/