题目链接:Curling 2.0
解题思路:扔冰壶,刚开始要是被直接锁住的话就不能扔了(一开始没注意,一直错。。。),还有最多扔十次,可以扔到之前扔过的点,所以不用记录之前的状态信息。(代码写的有点笨了)
#include<stdio.h>
#include<string.h>
#define SIZE 25
const int dir[4][2] = {0,1,0,-1,1,0,-1,0};
int map[SIZE][SIZE];
int ans, n, m;
int sx, sy, gx, gy;
int judge(int x, int y){
if(x <= 0 || y <= 0 || x > n || y > m){
return 0;
}
return 1;
}
void DFS(int x, int y, int depth){
int i, j;
if(depth > 10){
return;
}
if(x == gx && y == gy){
if(ans > depth){
ans = depth;
}
}
for(i = 0; i < 4; i++){
int temx = x, temy = y;
while(map[temx][temy] != 1){
temx += dir[i][0];
temy += dir[i][1];
if(!judge(temx, temy)){
temx = temy = -1;
break;
}
if(temx == gx && temy == gy){
DFS(gx, gy, depth + 1);
}
}
if(temx == temy && temy == -1 || temx - dir[i][0] == x && temy - dir[i][1] == y){
continue;
}
else{
//if(!v[temx - dir[i][0]][temy - dir[i][1]]){
map[temx][temy] = 0;
// v[temx - dir[i][0]][temy - dir[i][1]] = 1;
DFS(temx - dir[i][0], temy - dir[i][1], depth + 1);
map[temx][temy] = 1;
// v[temx - dir[i][0]][temy - dir[i][1]] = 0;
// }
}
}
}
int main(){
int i, j;
//freopen("in.txt", "r", stdin);
while(scanf("%d%d", &m, &n) != EOF){
if(!m && !n) return 0;
//memset(v, 0, sizeof(v));
ans = 9999;
for(i = 1; i <= n; i++){
for(j = 1; j <= m; j++){
scanf("%d", &map[i][j]);
if(map[i][j] == 2){
sx = i;sy = j;
}
if(map[i][j] == 3){
gx = i;gy = j;
}
}
}
//v[sx][sy] = 1;
DFS(sx, sy, 0);
printf("%d\n", ans == 9999 ? -1 : ans);
}
return 0;
}