POJ1992 Jack(DP 记忆化)

最新推荐文章于 2020-10-17 13:05:56 发布

nextcy

最新推荐文章于 2020-10-17 13:05:56 发布

阅读量1.2k

点赞数

分类专栏： ACM 文章标签： each numbers input character integer path

本文链接：https://blog.csdn.net/chaiyuan414/article/details/5450712

版权

ACM 专栏收录该内容

52 篇文章 0 订阅

订阅专栏

Jack

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 910		Accepted: 309

Description

We need to have at least one computer game in our collection, of course. The typical one could be described as "chase in the town". The smiling face called Jack in our case is walking through the town divided into small fields. Some of the fields are covered with the wall and it is not possible to go through them. Jack collects the points and tries to avoid contact with the monsters who chase him. Once the Jack eats the special point (or asterisk), the situation turns upside-down and Jack can eat monsters. And so on, still again and again. I am sure everyone of you have ever seen such game.

The town is randomly generated in our case. Jack always starts in the top left corner and the "bonus asterisk" is in the bottom right corner. At the most difficult level, the bonus is set to disappear after exactly as much steps that are sufficient to get from one corner to another, providing Jack only makes steps to the left and to the bottom. Should he made one single step into the wrong direction and he never could be there in time. But it is still important to prevent being catched by monsters. So the player has to choose the best possible way to the bottom right corner. You are to determine how many different ways exist in the town.

Input

The input consists of Z assignments. The number of them is given by the single positive integer Z appearing on the first line of input. Each assignment begins with the line containing two possitive numbers R and S (1 <= R,S <= 1000). The numbers determine the number of town rows and columns. Then there are R lines each containing exactly S characters. Each character may be either hash (#) or period (.). Hash mark means the wall and the period is free space. The top left and bottom right corners are always free.

Output

Print exactly one line for each of the input cases. The line must contain the statement "Existuje X ruznych cest.", (There are X different paths). Replace X with the number of all existing different paths between the top left and the bottom right corner. Each path must consist of R+S-2 steps, each leading to the left or to the right. No path can cross any field with the wall.

Sample Input

2
3 3
...
.#.
...
1 6
...#..

Sample Output

Existuje 2 ruznych cest.
Existuje 0 ruznych cest.
这题的题意很简单，问从左上角到右下角的路径有多少，且只能往右和往下。'.'表示路，'#'表示墙。本来是

用二维的，一直超时，后来看到一位大牛的做法，我恍然大悟才知道用一维的也可以做，这题的动态方程是：

for(j=1;j<=m;j++)
{       if(i==1&&j==1)  continue;
        if(map[j]=='.')
               way[j]+=way[j-1];
        else way[j]=0;
}

看了这个方程可能你还有一点不知道怎么做，看看下面的代码：

#include<iostream>
using namespace std;
int way[1001];
char map[1001];
int main()
{
  int t,i,j,n,m;
  scanf("%d",&t);
  while(t--)
  {
     scanf("%d%d",&n,&m);  
     memset(way,0,sizeof(way));
     way[1]=1;
     for(i=1;i<=n;i++)
     {
        scanf("%s",map+1);
        for(j=1;j<=m;j++)
        {  if(i==1&&j==1)  continue;
           if(map[j]=='.')
               way[j]+=way[j-1];
           else way[j]=0;
        }
     }
     printf("Existuje %d ruznych cest./n",way[m]);
  }
  return 0;
}