搜索专题

bfs搜索
https://ac.nowcoder.com/acm/problem/16423

AC代码：

#include<iostream>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
int n,m;
int inf=1e9,mincost=1e9;
int chess[105][105];
int visit[105][105];
int dir[4]={-1,0,1,0};
typedef struct node{
	int x,y;
	int cost;
	int used;
	int color;
}node;

vector<node> quene;
node slove(node nod,int ex,int ey){
	int i,j;
	node nodd;//cout<<ex<<" "<<ey<<" "<<nod.color<<" "<<chess[ex][ey]<<" "<<visit[ex][ey]<<endl;
	int x=nod.x;int y=nod.y;int used=nod.used;
	int cost=nod.cost;int color=nod.color;
	if(color==1){
		if(chess[ex][ey]==1){
			if(visit[ex][ey]>cost){
				nodd.x=ex;nodd.y=ey;nodd.used=0;nodd.color=1;nodd.cost=cost;
			    visit[ex][ey]=cost;
			    return nodd;
			}
		}
		else if(chess[ex][ey]==0){
			if(visit[ex][ey]>cost+1){
				nodd.x=ex;nodd.y=ey;nodd.used=0;nodd.color=0;nodd.cost=cost+1;
				visit[ex][ey]=cost+1;
			    return nodd;
			}
		}
		else if(chess[ex][ey]==-1){
			if(used==0){
				if(visit[ex][ey]>cost+2){
				    nodd.x=ex;nodd.y=ey;nodd.used=1;nodd.color=1;nodd.cost=cost+2;
				    visit[ex][ey]=cost+2;
			        return nodd;
			    }
			}
		}
	}
	else if(color==0){
		if(chess[ex][ey]==0){
			if(visit[ex][ey]>cost){
				nodd.x=ex;nodd.y=ey;nodd.used=0;nodd.cost=cost;nodd.color=0;
				visit[ex][ey]=cost;
				return nodd;
			}
		}
		else if(chess[ex][ey]==1){
			if(visit[ex][ey]>cost+1){
				nodd.x=ex;nodd.y=ey;nodd.used=0;nodd.cost=cost+1;nodd.color=1;
				visit[ex][ey]=cost+1;
				return nodd;
			}
		}
		else if(chess[ex][ey]==-1){
			if(used==0){
				if(visit[ex][ey]>cost+2){
				    nodd.x=ex;nodd.y=ey;nodd.used=1;nodd.color=0;nodd.cost=cost+2;
				    visit[ex][ey]=cost+2;
			        return nodd;
			    }
			}
		}
	}
	nodd.x=-1;nodd.y=-1;nodd.used=1;nodd.color=0;nodd.cost=cost+2;
	return nodd;
}
void bfs(){
	int i,j;
	node nod,nodd;
	nod.x=0;nod.y=0;nod.used=0;nod.cost=0;nod.color=chess[0][0];
	visit[0][0]=0;
	quene.push_back(nod);
	while(quene.size()!=0){
		nod=quene[0];quene.erase(quene.begin());
		int x=nod.x;int y=nod.y;int used=nod.used;
		int cost=nod.cost;int color=nod.color;//cout<<x<<" "<<y<<endl;
		if(x==m-1&&y==m-1){
			if(cost<mincost){
				mincost=cost;
			}
		}
		for(i=0;i<4;i++){
			x=nod.x+dir[i];y=nod.y+dir[(i+1)%4];
			if(x<0||x>=m||y<0||y>=m) continue;
			nodd=slove(nod,x,y);//cout<<nodd.x<<endl;
			if(nodd.x!=-1){
				quene.push_back(nodd);
			}
		}
	}
}
int main(){
	int i,j,p,q,r;
	memset(chess,-1,sizeof(chess));
	for(i=0;i<105;i++){
		for(j=0;j<105;j++){
			visit[i][j]=inf;
		}
	}
	cin>>m>>n;
	for(i=0;i<n;i++){
		cin>>p>>q>>r;
		p--;q--;
		chess[p][q]=r;
	}
	bfs();
	if(mincost!=1e9){
		cout<<mincost<<endl;
	}
	else{
		cout<<"-1"<<endl;
	}
	return 0;
}