HDU 1078 FatMouse and Cheese
来源:互联网 发布:四川联通大数据 编辑:程序博客网 时间:2024/06/05 07:28
FatMouse and Cheese
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 37 Accepted Submission(s) : 26
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid location Fatmouse has hid between 0 and 100 blocks of cheese in a hole. Now he's going to enjoy his favorite food.
FatMouse begins by standing at location (0,0). He eats up the cheese where he stands and then runs either horizontally or vertically to another location. The problem is that there is a super Cat named Top Killer sitting near his hole, so each time he can run at most k locations to get into the hole before being caught by Top Killer. What is worse -- after eating up the cheese at one location, FatMouse gets fatter. So in order to gain enough energy for his next run, he has to run to a location which have more blocks of cheese than those that were at the current hole.
Given n, k, and the number of blocks of cheese at each grid location, compute the maximum amount of cheese FatMouse can eat before being unable to move.
FatMouse begins by standing at location (0,0). He eats up the cheese where he stands and then runs either horizontally or vertically to another location. The problem is that there is a super Cat named Top Killer sitting near his hole, so each time he can run at most k locations to get into the hole before being caught by Top Killer. What is worse -- after eating up the cheese at one location, FatMouse gets fatter. So in order to gain enough energy for his next run, he has to run to a location which have more blocks of cheese than those that were at the current hole.
Given n, k, and the number of blocks of cheese at each grid location, compute the maximum amount of cheese FatMouse can eat before being unable to move.
Input
There are several test cases. Each test case consists of
a line containing two integers between 1 and 100: n and k
n lines, each with n numbers: the first line contains the number of blocks of cheese at locations (0,0) (0,1) ... (0,n-1); the next line contains the number of blocks of cheese at locations (1,0), (1,1), ... (1,n-1), and so on.
The input ends with a pair of -1's.
a line containing two integers between 1 and 100: n and k
n lines, each with n numbers: the first line contains the number of blocks of cheese at locations (0,0) (0,1) ... (0,n-1); the next line contains the number of blocks of cheese at locations (1,0), (1,1), ... (1,n-1), and so on.
The input ends with a pair of -1's.
Output
For each test case output in a line the single integer giving the number of blocks of cheese collected.
Sample Input
3 11 2 510 11 612 12 7-1 -1
Sample Output
37
Source
Zhejiang University Training Contest 2001
<pre name="code" class="cpp">#include<iostream>#include<stdio.h>#include<cmath>#include<string.h>#include<string>#include<queue>#include<stack>using namespace std;const int M=110;int i,j,k,n,m;int point[M][M];int flag[M][M];int dir[4][2]={-1,0,1,0,0,1,0,-1};void dfs(int x,int y) //regard as recursion is easy to understanding{ int m=0; if(flag[x][y])return; for(int i=0;i<4;i++) for(int j=1;j<=k;j++) { int xx=x+dir[i][0]*j; int yy=y+dir[i][1]*j; if(xx>=0&&yy>=0&&xx<n&&yy<n&&point[xx][yy]>point[x][y]) { dfs(xx,yy); if(flag[xx][yy]>m) m=flag[xx][yy]; } } flag[x][y]=m+point[x][y];}int main(){ while(cin>>n>>k) { if(n==-1&&k==-1)break; for(i=0;i<n;i++) for(j=0;j<n;j++) cin>>point[i][j]; memset(flag,0,sizeof(flag)); dfs(0,0); cout<<flag[0][0]<<endl; } return 0;}
0 0
- HDU 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu-1078-FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- Hdu 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- 第三天
- android4.4 添加快捷开关(以截屏为例)
- python探索
- WebView加载Html出现有时页面显示不全问题
- 不敢死队问题
- HDU 1078 FatMouse and Cheese
- Android 联系人数据库介绍以及对联系人的基本操作
- CodeForces 547A Mike and Frog
- 【数字图像】BMP位图的头文件
- LeetCode 9. Palindrome Number
- 地图资料学习
- 方向检测,判断一个点位于射线的位于左边,右边,或者线上
- Python学习笔记10:Python错误和异常
- String 与 int之间的转换