POJ 2704 Pascal's Travels (基础记忆化搜索)
来源:互联网 发布:数据库和java前景 编辑:程序博客网 时间:2024/05/21 21:24
Pascal's Travels
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5328 Accepted: 2396
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
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 263 paths for any board.
Sample Input
423311213123131104333212131232212051110101111111111110111101-1
Sample Output
307
Hint
Brute force methods examining every path will likely exceed the allotted time limit. 64-bit integer values are available as long values in Java or long long values using the contest's C/C++ compilers.
Source
Mid-Central USA 2005
题目链接:http://poj.org/problem?id=2704
题目大意:从左上角开始到右下角,每次只能向右或者向下,并且只能走当前位置点数的步数,求从起点到终点有多少种走法
题目分析:很简单的记忆化搜索,dp[i][j]记录点(i,j)到终点的方案数,注意要用unsigned long long,long long都跪了
题目链接:http://poj.org/problem?id=2704
题目大意:从左上角开始到右下角,每次只能向右或者向下,并且只能走当前位置点数的步数,求从起点到终点有多少种走法
题目分析:很简单的记忆化搜索,dp[i][j]记录点(i,j)到终点的方案数,注意要用unsigned long long,long long都跪了
#include <cstdio>#include <cstring>#define ull unsigned long longint const MAX = 40;int map[MAX][MAX];ull dp[MAX][MAX];int n;ull DFS(int x, int y){ if(dp[x][y]) return dp[x][y]; if(x > n || y > n) return 0; if(x == n && y == n) return 1; if(map[x][y] == 0) return dp[x][y] = 0; ull tmp = 0; tmp += DFS(x + map[x][y], y); tmp += DFS(x, y + map[x][y]); return dp[x][y] = tmp;}int main(){ while(scanf("%d", &n) != EOF && n != -1) { char s[100]; memset(dp, 0, sizeof(dp)); for(int i = 1; i <= n; i++) { scanf("%s", s + 1); for(int j = 1; j <= n; j++) map[i][j] = s[j] - '0'; } printf("%llu\n", DFS(1, 1)); }}
0 0
- POJ 2704 Pascal's Travels (基础记忆化搜索)
- POJ 2704 Pascal's Travels (记忆化搜索裸题)
- POJ-2704(化搜索为简答记忆)(Pascal's Travels )
- hdoj 1028/poj 2704 Pascal's Travels(记忆化搜索||dp)
- hdu 1208 Pascal's Travels (DP记忆化搜索)
- HDU 1208 Pascal's Travels(记忆化搜索)
- HDU 1208 Pascal's Travels( 记忆化搜索)
- hdu 1208 Pascal's Travels 记忆化搜索
- POJ 2704 Pascal's Travels
- POJ2704 Pascal's Travels (记忆化DP)
- poj 2704 Pascal's Travels_记忆化搜索
- POJ 2704(Pascal's Travels-裸dp)
- poj 2704 Pascal's Travels 动态规划
- poj2704Pascal's Travels【记忆化搜索】
- 【DFS(记忆化)】hdu 1208 Pascal's Travels
- HDU--杭电--1208--Pascal's Travels--记忆化搜索--这个也和机器人那个一样算半个DP吧
- Pascal's Travels pku 2704
- pku 2704 Pascal's Travels
- Android 设置安装后界面显示的apk名
- Android中再按一次返回键退出程序的实现(返回桌面)两种方法
- 使用twemproxy搭建redis集群
- jdk
- 黑马程序员———OC的内存管理
- POJ 2704 Pascal's Travels (基础记忆化搜索)
- 浅谈php安全
- OpenCV保存成XML(FileStorage)和CSV(重载<<运算符)文件
- 基于Table方法降低代码圈复杂度
- java实现k-means算法(用的鸢尾花iris的数据集,从mysq数据库中读取数据)
- 1148. 过河
- iOS学习(view事件)
- 安装windows 8.1系统之后电脑无线网经常受限的问题
- LeetCod之Search in Rotated Sorted Array (C++)