HDU 1208 Pascal's Travels(记忆化搜索)

记忆化搜索这种东东以前好像没写过，这是第一次写吧，其实也挺好理解的啊。就是一个dp与搜索的结合，dfs后保存每一步的值，然后输出就行了啊。

Pascal's Travels

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1515    Accepted Submission(s): 666

Problem Description

An n x n game board is populated with integers, one nonnegative integer per square. The goal is to travel along any legitimate path from the upper left corner to the lower right corner of the board. The integer in any one square dictates how large a step away from that location must be. If the step size would advance travel off the game board, then a step in that particular direction is forbidden. All steps must be either to the right or toward the bottom. Note that a 0 is a dead end which prevents any further progress. 


Consider the 4 x 4 board shown in Figure 1, where the solid circle identifies the start position and the dashed circle identifies the target. Figure 2 shows the three paths from the start to the target, with the irrelevant numbers in each removed. 


Figure 1

Figure 2

 

Input

The input contains data for one to thirty boards, followed by a final line containing only the integer -1. The data for a board starts with a line containing a single positive integer n, 4 <= n <= 34, which is the number of rows in this board. This is followed by n rows of data. Each row contains n single digits, 0-9, with no spaces between them.

 

Output

The output consists of one line for each board, containing a single integer, which is the number of paths from the upper left corner to the lower right corner. There will be fewer than 2^63 paths for any board. 

 

Sample Input

  
  

   
   4
2331
1213
1231
3110
4
3332
1213
1232
2120
5
11101
01111
11111
11101
11101
-1
  
  

 

Sample Output

  
  

   
   3
0
7

  
  
  
  


  
  

#include <algorithm>
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <iomanip>
#include <stdio.h>
#include <string>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#define eps 1e-7
#define M 10001000
#define LL __int64
//#define LL long long
#define INF 0x3f3f3f3f
#define PI 3.1415926535898
const int maxn = 1000010;

using namespace std;

LL dp[50][50];
LL Map[50][50];
int n;
LL DP(LL x, LL y)
{
    if(x == n && y == n)
        return 1;
    if(!Map[x][y] || dp[x][y])
        return dp[x][y];
    if(x+Map[x][y] <= n)
        dp[x][y] += DP(x+Map[x][y], y);//递归下去；
    if(y+Map[x][y] <= n)
        dp[x][y] += DP(x, y+Map[x][y]);
    return dp[x][y];
}

int main()
{
    while(cin >>n)
    {
        if(n == -1)
            break;
        char str;
        for(int i = 1; i <= n; i++)
        {
            for(int j = 1; j <= n; j++)
            {
                cin >>str;
                Map[i][j] = str-'0';
            }
        }
        memset(dp , 0 , sizeof(dp));
        cout<<DP(1, 1)<<endl;
    }
}