F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist

C/C++/Java Exams
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
DIY | Web-DIY beta
Register new ID

# Find a path

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2408    Accepted Submission(s): 1041

Problem Description
Frog fell into a maze. This maze is a rectangle containing $N$ rows and $M$ columns. Each grid in this maze contains a number, which is called the magic value. Frog now stays at grid (1, 1), and he wants to go to grid (N, M). For each step, he can go to either the grid right to his current location or the grid below his location. Formally, he can move from grid (x, y) to (x + 1, y) or (x, y +1), if the grid he wants to go exists.
Frog is a perfectionist, so he'd like to find the most beautiful path. He defines the beauty of a path in the following way. Let’s denote the magic values along a path from (1, 1) to (n, m) as $A_1, A_2, … A_{N+M-1}$, and $A_{avg}$ is the average value of all $A_i$. The beauty of the path is $(N + M – 1)$ multiplies the variance of the values:$(N+M-1)\sum_{i=1}^{N+M-1}(A_{i}-A_{avg})^{2}$
In Frog's opinion, the smaller, the better. A path with smaller beauty value is more beautiful. He asks you to help him find the most beautiful path.

Input
The first line of input contains a number $T$ indicating the number of test cases ($T≤50$).
Each test case starts with a line containing two integers $N$ and $M$ ($1≤N,M≤30$). Each of the next $N$ lines contains $M$ non-negative integers, indicating the magic values. The magic values are no greater than 30.

Output
For each test case, output a single line consisting of “Case #X: Y”. $X$ is the test case number starting from 1. $Y$ is the minimum beauty value.

Sample Input
1
2 2
1 2
3 4


Sample Output
Case #1: 14

Source

Statistic | Submit | Discuss | Note
 Home | Top Hangzhou Dianzi University Online Judge 3.0 Copyright © 2005-2024 HDU ACM Team. All Rights Reserved. Designer & Developer : Wang Rongtao LinLe GaoJie GanLu Total 0.000000(s) query 1, Server time : 2024-08-14 18:20:14, Gzip enabled Administration