fjnu 1013 The Peanuts
来源:互联网 发布:淘宝外围正向和反向 编辑:程序博客网 时间:2024/04/30 15:19
Description
Mr. Robinson and his pet monkey Dodo love peanuts very much. One day while they were having a walk on a country road, Dodo found a sign by the road, pasted with a small piece of paper, saying "Free Peanuts Here! " You can imagine how happy Mr. Robinson and Dodo were.
There was a peanut field on one side of the road. The peanuts were planted on the intersecting points of a grid as shown in Figure-1. At each point, there are either zero or more peanuts. For example, in Figure-2, only four points have more than zero peanuts, and the numbers are 15, 13, 9 and 7 respectively. One could only walk from an intersection point to one of the four adjacent points, taking one unit of time. It also takes one unit of time to do one of the following: to walk from the road to the field, to walk from the field to the road, or pick peanuts on a point.
According to Mr. Robinson's requirement, Dodo should go to the plant with the most peanuts first. After picking them, he should then go to the next plant with the most peanuts, and so on. Mr. Robinson was not so patient as to wait for Dodo to pick all the peanuts and he asked Dodo to return to the road in a certain period of time. For example, Dodo could pick 37 peanuts within 21 units of time in the situation given in Figure-2.
Your task is, given the distribution of the peanuts and a certain period of time, tell how many peanuts Dodo could pick. You can assume that each point contains a different amount of peanuts, except 0, which may appear more than once.
Input
The first line of input contains the test case number T (1 <= T <= 20). For each test case, the first line contains three integers, M, N and K (1 <= M, N <= 50, 0 <= K <= 20000). Each of the following M lines contain N integers. None of the integers will exceed 3000. (M * N) describes the peanut field. The j-th integer X in the i-th line means there are X peanuts on the point (i, j). K means Dodo must return to the road in K units of time.
Output
For each test case, print one line containing the amount of peanuts Dodo can pick.
Sample Input
Sample Output26 7 210 0 0 0 0 0 00 0 0 0 13 0 00 0 0 0 0 0 70 15 0 0 0 0 00 0 0 9 0 0 00 0 0 0 0 0 06 7 200 0 0 0 0 0 00 0 0 0 13 0 00 0 0 0 0 0 70 15 0 0 0 0 00 0 0 9 0 0 00 0 0 0 0 0 0
3728
KEY:
由于猴子取果子要按照一定的顺序来取,所以要保证你取下一个果子,能够回去,貌似也没有什么要注意的了
- fjnu 1013 The Peanuts
- pku 1928 The Peanuts
- poj 1928 The Peanuts
- hdu 1355 The Peanuts
- hdu1355 The Peanuts
- POJ-1928-The Peanuts
- POJ1928 The Peanuts
- POJ1928 The Peanuts
- POJ 1928 The Peanuts
- POJ 1928 The Peanuts
- POJ 1928 The Peanuts
- ZOJ2235 POJ1928 HDU1355 The Peanuts
- hdu 1355 The Peanuts(DP)
- HDOJ 1355 The Peanuts(水)
- POJ 1928 The Peanuts 笔记
- The Peanuts--很水的模拟题~~
- 杭电OJ 1355:The Peanuts
- ACM篇:POJ 1928--The Peanuts
- TREEVIEW DATAGRIDVIEW
- VC6使用技巧
- c# 类的反射实例
- qq for linux官方版已经发布
- RMI使用中
- fjnu 1013 The Peanuts
- tomcat启动不了的原因
- 在存储过程中拥有"role"权限的特殊性
- vsftp完全手册【转】
- XP瞬间关机利弊
- linux下查看网卡地址和网关
- 近10年最强的50本计算机图书
- 如何去掉超链接的下划线
- 教你如何设置电脑开机后自动上网