poj 2644

Maze

Time Limit: 4000MS		Memory Limit: 65536K
Total Submissions: 792		Accepted: 140		Special Judge

Description

You have been blindfolded and deposited someplace in a maze. You have no idea where you are. You do know, however, that the maze is laid out on a grid, and that each grid location is either blocked or free. In fact, you have memorized a map of the maze. Also, your magnetic personality allows you to always sense which direction is north. 
In this maze, you have four possible moves: north, south, east, and west. Your task is to find the shortest sequence of moves that will guarantee your escape, regardless of your initial placement in the maze. You have "escaped" whenever you reach a square on an outside edge of the grid (and if you start there, then you've already escaped). Further moves are irrelevant once you have escaped. If you try to walk into a wall, you will simply stay in the same spot. 

You may assume that it is possible to escape from every unblocked position in the maze. 

Input

Input consists of a positive integer n <= 8, followed by n lines giving the rows of an n by n grid. This grid describes the maze you are trapped in. Written on the screen, north is up. Blocked locations are denoted by the character "O" (that's an uppercase "o"), while unblocked locations are indicated by the character ".".

Output

Output consists of a number of lines, each consisting of one of "north", "south", "east", or "west", indicating the shortest sequence of moves that guarantees escape for any possible unblocked starting position. 
If there are multiple possible shortest sequences, any of them will do. 

Sample Input

4
OO.O
...O
OO..
O..O

Sample Output

east
north

Source

Waterloo local 1999.06.19

分析：这题貌似只能用DFS，BFS爆内存，哎~~~改了我好久，还有DFS我居然变得这么挫，连标记都写错了

转别人的。。。。

 

简要题解：

DFS+剪枝+Hash判重。

对于一个n*n局面，只要保存中间(n-2)*(n-2)的boolean值就可以了，也就是最多36个。转成二进制，在mod一个大数用来判重（如果2个不同的局面hash值一样怎么办。。。不鸟它。。。）

强剪枝：已使用的步数+当前局面中所有点离出口的距离>=ans，就剪枝！

一个容易WA的地方：ans初始为(n-2)*(n-2)+1，实际上ans的上界为(n-2)*(n-2)，那为神马要初始成(n-2)*(n-2)+1?因为有可能答案只有一步，而比较的时候是if step<ans then ans:=step;

所以就没有将走法数组更新！

简而言之就是这样的数据

3

…

…

…

话说我是将图转换为n-2个二进制数，与题解不同

代码（好挫啊）：

 

#include<cstdio> #include<cstring> using namespace std; const int M=10000007; bool id[M]; int mapl[8],mapr[8],d[6][6],p[6],a[8][8],s[6],n,m,ans,c[36],dir[36]; inline int BKDRHash() { int i,hash; for(i=hash=0; i<=m; ++i)hash=hash*131+s[i]; return((hash&0x7FFFFFFF)%M); } inline void init() { int i,j; scanf("%d",&n),m=n-3; for(i=0; getchar(),i<n; ++i) { mapr[i]=0; for(j=n-1; j>=0; --j) if(a[i][n-j-1]=(getchar()=='O'))mapr[i]+=(1<<j); mapl[i]=mapr[i]>>1; } for(i=0; i<n-2; ++i)s[i]=(mapl[i+1]^((1<<(n-1))-1))&((1<<(n-2))-1); memset(d,100,sizeof(d)); for(i=0; i<=m; ++i) { if(!(a[i+1][n-1]||a[i+1][m+1]))d[i][m]=1; if(!(a[n-1][i+1]||a[m+1][i+1]))d[m][i]=1; if(!(a[i+1][0]||a[i+1][1]))d[i][0]=1; if(!(a[0][i+1]||a[1][i+1]))d[0][i]=1; p[i]=1<<(m-i); } bool flag=1; while(flag) { flag=0; for(i=0; i<=m; ++i) for(j=0; j<=m; ++j) if(!a[i+1][j+1]) { if(j>0&&d[i][j]>d[i][j-1]+1)d[i][j]=d[i][j-1]+1,flag=1; if(j<m&&d[i][j]>d[i][j+1]+1)d[i][j]=d[i][j+1]+1,flag=1; if(i>0&&d[i][j]>d[i-1][j]+1)d[i][j]=d[i-1][j]+1,flag=1; if(i<m&&d[i][j]>d[i+1][j]+1)d[i][j]=d[i+1][j]+1,flag=1; } } memset(id,1,sizeof(id)); } inline void cpy(int *p,int *q,int h) { for(int i=0; i<h; ++i,++p,++q)*p=*q; } inline void walk(int d) { if(d==0)//north { s[0]&=mapl[0]; for(int i=1,g; i<=m; ++i) if(s[i])g=s[i],s[i]&=mapl[i],s[i-1]|=(g^s[i]); } else if(d==2)//south { s[m]&=mapl[m+2]; for(int i=m-1,g; i>=0; --i) if(s[i])g=s[i],s[i]&=mapl[i+2],s[i+1]|=(g^s[i]); } else if(d==3)//west { for(int i=0,g; i<=m; ++i) if(s[i]) { s[i]<<=1; g=s[i]&mapl[i+1]; s[i]^=g; s[i]|=(g>>1); s[i]&=((1<<(m+1))-1); } } else//east { for(int i=0,g; i<=m; ++i) if(s[i]) { g=s[i]&mapr[i+1]; s[i]^=g; s[i]|=(g<<1); s[i]>>=1; } } } inline void out(int x) { if(x==0)putchar('n'),putchar('o'),putchar('r'),putchar('t'),putchar('h'); else if(x==2)putchar('s'),putchar('o'),putchar('u'),putchar('t'),putchar('h'); else if(x==3)putchar('w'),putchar('e'),putchar('s'),putchar('t'); else putchar('e'),putchar('a'),putchar('s'),putchar('t'); putchar('/n'); } inline void dfs(int step) { bool ok=1; for(int i=0; i<=m; ++i) for(int j=0; j<=m; ++j) if(s[i]&p[j]) { if(step+d[i][j]>=ans)return; ok=0; } if(step>=ans)return; if(ok) { ans=step; cpy(dir,c,ans); return; } int w[6]; cpy(w,s,m+1); for(int i=0,j; i<4; ++i) { walk(i); if(id[j=BKDRHash()])id[j]=0,c[step]=i,dfs(step+1),id[j]=1; cpy(s,w,m+1); } } int main(int argc, char* argv[]) { init(); ans=(n-2)*(n-2)+1; dfs(0); for(int i=0; i<ans; ++i)out(dir[i]); return 0; }