当前位置:网站首页>HDU - 1078 fatmouse and cheese (memory search DP)
HDU - 1078 fatmouse and cheese (memory search DP)
2022-07-04 21:50:00 【WA_ automata】
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;
}
边栏推荐
- Compréhension approfondie du symbole [langue C]
- ArcGIS 10.2.2 | solution to the failure of ArcGIS license server to start
- WGCNA analysis basic tutorial summary
- Go language loop statement (3 in Lesson 10)
- Learning breakout 3 - about energy
- HDU - 1078 FatMouse and Cheese(记忆化搜索DP)
- Interpreting the development of various intelligent organizations in maker Education
- minidom 模塊寫入和解析 XML
- Redis 排查大 key 的3种方法,优化必备
- 时空预测3-graph transformer
猜你喜欢
Redis 排查大 key 的3种方法,优化必备
Case sharing | integrated construction of data operation and maintenance in the financial industry
How was MP3 born?
MP3是如何诞生的?
Maya lamp modeling
[weekly translation go] how to code in go series articles are online!!
Billions of citizens' information has been leaked! Is there any "rescue" for data security on the public cloud?
TCP三次握手,四次挥手,你真的了解吗?
Daily question -leetcode1200- minimum absolute difference - array - sort
【活动早知道】LiveVideoStack近期活动一览
随机推荐
Redis bloom filter
Why does invariant mode improve performance
gtest从一无所知到熟练使用(4)如何用gtest写单元测试
Compréhension approfondie du symbole [langue C]
Flutter 返回按钮的监听
CloudCompare&Open3D DBSCAN聚类(非插件式)
GTEST from ignorance to skillful use (1) GTEST installation
Interviewer: what is XSS attack?
[buuctf.reverse] 151_ [FlareOn6]DnsChess
2022 version of stronger jsonpath compatibility and performance test (snack3, fastjson2, jayway.jsonpath)
解析互联网时代的创客教育技术
学习突围3 - 关于精力
每日一题-LeetCode556-下一个更大元素III-字符串-双指针-next_permutation
巅峰不止,继续奋斗!城链科技数字峰会于重庆隆重举行
Jerry's ad series MIDI function description [chapter]
哈希表(Hash Tabel)
类方法和类变量的使用
Numpy vstack and column_ stack
时空预测3-graph transformer
应用实践 | 蜀海供应链基于 Apache Doris 的数据中台建设