201604-4 test title: Game (BFS search maze)

 #include<cstdio>
 #include<cstring>
 #include<queue>
 using namespace std;// Don't add using namespace std  queu Report errors  
 
 struct direct{
 	int dr,dc;
 }direct[4]={
   {-1,0},{1,0},{0,-1},{0,1}};

int visited[101][101][300];

struct node{
	int row,col,level;
};

int bfs(int n,int m){ 
	// initialization , Queue entry  
	node start,front,v;
	start.row=1;
	start.col=1;
	start.level=0;
	queue<node> q;
	q.push(start);
	//while loop  
	while(!q.empty()){
		front=q.front();
		q.pop();
		printf("(%d , %d)---%d\n",front.row,front.col,front.level);
		// The boundary conditions  
		if(front.row==n&&front.col==m)return front.level;
		// Search for  
		for(int i=0;i<4;i++){
			v.row=front.row+direct[i].dr;
			v.col=front.col+direct[i].dc;
			v.level=front.level+1;
			// out  
			if(v.row<1||v.row>n||v.col<1||v.col>m)continue;
			// dangerous  
			if(visited[v.row][v.col][v.level])continue;
			// Search forward  
			visited[v.row][v.col][v.level]=1;
			q.push(v);
		}
	}
	return 0;
}

int main(){
	
int n,m,t,r,c,a,b;

memset(visited,0,sizeof(visited));
scanf("%d%d%d",&n,&m,&t);
for(int i=1;i<=t;i++){
	scanf("%d%d%d%d",&r,&c,&a,&b);// Note enter here  ,“&” Often make mistakes  
	for(int j=a;j<=b;j++)visited[r][c][j]=1;
} 
int ans=bfs(n,m);
printf("%d",ans);
return 0;	
}