Tempter of the Bone
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 91180 Accepted Submission(s): 24792
The maze was a rectangle with sizes N by M. There was a door in the maze. At the beginning, the door was closed and it would open at the T-th second for a short period of time (less than 1 second). Therefore the doggie had to arrive at the door on exactly the T-th second. In every second, he could move one block to one of the upper, lower, left and right neighboring blocks. Once he entered a block, the ground of this block would start to sink and disappear in the next second. He could not stay at one block for more than one second, nor could he move into a visited block. Can the poor doggie survive? Please help him.
'X': a block of wall, which the doggie cannot enter;
'S': the start point of the doggie;
'D': the Door; or
'.': an empty block.
The input is terminated with three 0's. This test case is not to be processed.
4 4 5 S.X. ..X. ..XD .... 3 4 5 S.X. ..X. ...D 0 0 0
NOYES
奇偶剪枝技巧
#include <stdio.h> #include <iostream> #include <string.h> #include <stdlib.h> using namespace std; char map[9][9]; int n,m,t,di,dj; bool escape; int dir[4][2]={{0,-1},{0,1},{1,0},{-1,0}}; void dfs(int si,int sj,int cnt) { int i,temp; if( si>n || sj>m || si<=0 || sj<=0 ) return; if( si==di && sj==dj && cnt==t ) { escape = 1; return; } temp = (t-cnt) - abs(si-di) - abs(sj-dj); if( temp<0 || temp&1 ) return; for( i=0; i<4; i++ ) { if( map[ si+dir[i][0] ][ sj+dir[i][1] ] != 'X') { map[ si+dir[i][0] ][ sj+dir[i][1] ] = 'X'; dfs(si+dir[i][0], sj+dir[i][1], cnt+1); if(escape) return; map[ si+dir[i][0] ][ sj+dir[i][1] ] = '.'; } } return; } int main() { int i,j,si,sj; while( cin >> n >> m >> t) { if( n==0 && m==0 && t==0 ) break; int wall = 0; for( i=1; i<=n; i++ ) for( j=1; j<=m; j++ ) { cin >> map[i][j]; if(map[i][j]=='S') { si=i; sj=j; } else if( map[i][j]=='D' ) { di=i; dj=j; } else if( map[i][j]=='X' ) wall++; } if( n*m-wall <= t ) { cout << "NO" << endl; continue; } escape = 0; map[si][sj] = 'X'; dfs( si, sj, 0 ); if( escape ) cout << "YES" << endl; else cout << "NO" << endl; } return 0; }