当前位置:网站首页>HDU - 1078 FatMouse and Cheese(记忆化搜索DP)
HDU - 1078 FatMouse and Cheese(记忆化搜索DP)
2022-07-04 21:03:00 【WA_自动机】
HDU - 1078 FatMouse and Cheese
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.
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.
Output
For each test case output in a line the single integer giving the number of blocks of cheese collected.
Sample Input
3 1
1 2 5
10 11 6
12 12 7
-1 -1
Sample Output
37
#include<iostream>
#include<cstring>
using namespace std;
const int N = 110;
const int dx[4]={
-1,0,1,0},dy[4]={
0,1,0,-1};
int g[N][N],ans[N][N];
int n,k;
int dfs(int x,int y)
{
if(ans[x][y]) return ans[x][y];
else
{
int sum=0;
for(int i=0;i<4;i++)
for(int j=1;j<=k;j++)
{
int xx=x+j*dx[i],yy=y+j*dy[i];
if(xx>=1&&xx<=n&&yy>=1&&yy<=n&&g[xx][yy]>g[x][y])
sum=max(sum,dfs(xx,yy));
}
ans[x][y]=sum+g[x][y];
return ans[x][y];
}
}
int main()
{
while(cin>>n>>k)
{
if(n==-1&&k==-1) break;
memset(ans,0,sizeof ans);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
cin>>g[i][j];
cout<<dfs(1,1)<<endl;
}
return 0;
}
边栏推荐
- MYSQL 用!=查询不出等于null的数据,解决办法
- Exclusive interview of open source summer | new committer Xie Qijun of Apache iotdb community
- OMS系统实战的三两事
- Shutter WebView example
- Flutter 返回按钮的监听
- Le module minidom écrit et analyse XML
- 哈希表(Hash Tabel)
- Daily question -leetcode1200- minimum absolute difference - array - sort
- 历史最全混合专家(MOE)模型相关精选论文、系统、应用整理分享
- redis布隆过滤器
猜你喜欢
How to implement Devops with automatic tools
Analysis of maker education technology in the Internet Era
奋斗正当时,城链科技战略峰会广州站圆满召开
【公开课预告】:视频质量评价基础与实践
How to remove the black dot in front of the title in word document
Methods of improving machine vision system
How was MP3 born?
QT—双缓冲绘图
案例分享|金融业数据运营运维一体化建设
torch. Tensor and torch The difference between tensor
随机推荐
WGCNA analysis basic tutorial summary
Keep on fighting! The city chain technology digital summit was grandly held in Chongqing
[buuctf.reverse] 151_ [FlareOn6]DnsChess
Jerry added the process of turning off the touch module before turning it off [chapter]
奋斗正当时,城链科技战略峰会广州站圆满召开
gtest从一无所知到熟练使用(2)什么是测试夹具/装置(test fixture)
A quick start to fastdfs takes you three minutes to upload and download files to the ECS
Solve the problem of data disorder caused by slow asynchronous interface
Interviewer: what is XSS attack?
案例分享|金融业数据运营运维一体化建设
一文掌握数仓中auto analyze的使用
[ 每周译Go ] 《How to Code in Go》系列文章上线了!!
MP3是如何诞生的?
Huawei ENSP simulator layer 3 switch
如何使用ConcurrentLinkedQueue做一个缓存队列
TCP三次握手,四次挥手,你真的了解吗?
输入的查询SQL语句,是如何执行的?
MP3是如何诞生的?
Hash table
Delphi soap WebService server-side multiple soapdatamodules implement the same interface method, interface inheritance