机试指南-深搜-类似迷宫题

问题大意

剪枝

代码

#include <iostream>
#include <algorithm>
#include <queue>
#include <vector>
#include <cmath>
#include <cstring>

#define N 105

using namespace std;

int m, n, T;
char temple[N][N]; // 数据 
int visited[N][N];

int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};

bool isFind = false;
void backTrack(int x, int y, int t){
	// 遍历下一个位置 
	for(int i = 0; i < 4 && !isFind; i++){
		if(x + dx[i] < 1 || x + dx[i] > m || y + dy[i] < 1 || y + dy[i] > n){
			continue;
		}
		if(temple[x + dx[i]][y + dy[i]] == '.' && !visited[x + dx[i]][y + dy[i]]){ // 可行 
			visited[x + dx[i]][y + dy[i]] = 1;
			backTrack(x + dx[i], y + dy[i], t + 1);
			visited[x + dx[i]][y + dy[i]] = 0;
		}else if(temple[x + dx[i]][y + dy[i]] == 'D' && t + 1 == T){
			isFind = true;
			return;
		}
	}
}

int main(){
	freopen("in.txt", "r", stdin);
	
	while(cin >> m >> n >> T){
		if(m == 0 && n == 0 && T == 0){
			break;
		}
		
		int start_i, start_j; // S
		int end_i, end_j; // D
		// 读取数据，顺便找S和D
		for(int i = 1; i <= m; i++){
			for(int j = 1; j <= n; j++){
				cin >> temple[i][j];
				visited[i][j] = 0;
				
				if(temple[i][j] == 'S'){
					start_i = i;
					start_j = j;
				}
				if(temple[i][j] == 'D'){
					end_i = i;
					end_j = j;
				}
			}
		}
		
		// 判断是否可行，不可行直接NO 
		int tmp = (start_i + start_j) - (end_i + end_j);
		tmp = tmp > 0 ? tmp : -tmp;
		if(tmp % 2 != T % 2){
			cout << "NO" << endl;
			continue;
		}
		
		isFind = false;
		backTrack(start_i, start_j, 0);
		if(isFind){
			cout << "YES" << endl;
		}else{
			cout << "NO" << endl;
		}
	}
	
	return 0;
}