bfs——search

原文链接：https://www.luogu.com.cn/problem/P1189

AC代码：

#include<iostream>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int r,c,n,m,sx,sy;
int visit[55][55];
char mapp[55][55];
typedef struct node{
	int x;int y;
}node;
node nod,nodd;
vector<node> vec;
vector<node> que[1005];
void bfs(){
	int i=0,j;
	nod.x=sx;nod.y=sy;
	que[i].push_back(nod);
	while(1){
		memset(visit,0,sizeof(visit));
	while(que[i].size()!=0){
		nod=que[i][0];que[i].erase(que[i].begin());
		//cout<<nod.x<<" "<<nod.y<<endl;
		nodd=vec[i];
		while(nodd.x+nod.x>=0&&nodd.x+nod.x<r&&nodd.y+nod.y>=0&&nodd.y+nod.y<c){
			nod.x=nodd.x+nod.x;nod.y=nodd.y+nod.y;
			if(mapp[nod.x][nod.y]=='X') break;
			if(visit[nod.x][nod.y]==0){
				visit[nod.x][nod.y]=1;
				que[i+1].push_back(nod);
				if(i==vec.size()-1){
					mapp[nod.x][nod.y]='*';
				}
			}
		}
	}
	i++;
	if(i==vec.size()) break;
	}
}
int main(){
	int i,j;
	cin>>r>>c;
	for(i=0;i<r;i++){
		for(j=0;j<c;j++){
			cin>>mapp[i][j];
			if(mapp[i][j]=='*'){
				sx=i;sy=j;
			}
		}
	}
	cin>>n;
	for(i=0;i<n;i++){
		string st;
		cin>>st;
		if(st=="NORTH"){
			nod.x=-1;nod.y=0;
			vec.push_back(nod);
		}
		else if(st=="SOUTH"){
			nod.x=1;nod.y=0;
			vec.push_back(nod);
		}
		else if(st=="WEST"){
			nod.x=0;nod.y=-1;
			vec.push_back(nod);
		}
		else if(st=="EAST"){
			nod.x=0;nod.y=1;
			vec.push_back(nod);
		}
	}
	mapp[sx][sy]='.';
	bfs();
	for(i=0;i<r;i++){
		for(j=0;j<c;j++){
			cout<<mapp[i][j];
		}
		cout<<endl;
	}
	return 0;
}