lightoj 1036 A Refining Company（矩形dp）

1036 - A Refining Company

PDF (English)

Statistics

Forum

Time Limit: 3 second(s)

Memory Limit: 32 MB

Its year 2200, planet Earth is out of resources and people are relying on the resources from other planets. There are several Refining Companies who collect these resources from other planets and bring them back to Earth. The task may sound simple, but in reality it's a challenging job. The resources are scattered and after collecting them, they have to be taken to a place where they can be refined. Since some minerals are extremely dangerous, the whole process should be done very carefully. A single tiny mistake can cause a massive explosion resulting in a huge loss.

You work in such a company who collects Uranium and Radium from planet Krypton. These minerals are used for generating powers. For simplicity you have divided planet Krypton into cells that form a matrix of m rows and n columns, where the rows Go from east to west and the columns go from north to south. Your advanced mine detector has detected the approximate amount of Radium and Uranium in each cell. Your company has built two refining factories, one in West and the other in North. The factory in North is used to refine Radium and the factory in West is used to refine Uranium. Your task is to design the conveyor belt system that will allow them to mine the largest amount of minerals.

There are two types of conveyor belts: the first moves minerals from east to west, the second moves minerals from south to north. In each cell you can build either type of conveyor belt, but you cannot build both of them in the same cell. If two conveyor belts of the same type are next to each other, then they can be connected. For example, the Radium mined at a cell can be transported to the Radium refinement factory via a series of south-north conveyor belts.

The minerals are very unstable, thus they have to be brought to the factories on a straight path without any turns. This means that if there is a south-north conveyor belt in a cell, but the cell north of it contains an east-west conveyor belt, then any mineral transported on the south-north conveyor belt will be lost. The minerals mined in a particular cell have to be put on a conveyor belt immediately; in the same cell (thus they cannot start the transportation in an adjacent cell). Furthermore, any Radium transported to the Uranium refinement factory will be lost, and vice versa.

Your program has to design a conveyor belt system that maximizes the total amount of minerals mined, i.e., the sum of the amount of Radium transported to the Radium refinery and the amount of Uranium to the Uranium refinery.

Input

Input starts with an integer T (≤ 10), denoting the number of test cases.

Each case begins with a blank line and two integers: m - the number of rows, and n - the number columns (1 ≤ m, n ≤ 500). The next m lines describe the amount of Uranium that can be found in the cells. Each of these m lines contains n integers. The first line corresponds to the northernmost row; the first integer of each line corresponds to the westernmost cell of the row. The integers are between 0 and 1000. The next m lines describe in a similar fashion the amount of Radium found in the cells. Data set is huge, so use faster i/o methods.

Output

For each case of input you have to print the case number and the maximum amount of minerals you can collect.

Sample Input	Output for Sample Input
2   4 4 0 0 10 9 1 3 10 0 4 2 1 3 1 1 20 0 10 0 0 0 1 1 1 30 0 0 5 5 5 10 10 10   2 3 5 10 34 0 0 0 0 0 0 50 0 0	Case 1: 98 Case 2: 50

Note

Dataset is huge. Use faster I/O methods.

---

SPECIAL THANKS: JANE ALAM JAN (MODIFIED DESCRIPTION, DATASET)

题意：

在一个n∗m(n,m<=500)的地图里有R矿和U矿,当你在某个点(x,y),可以建造一个只能向西或者向北挖取矿石的履带车, R矿石只能被向北移动的履带车挖取,U矿石只能被向西移动的履带车挖取,并且履带车不能交叉, 给出你每个地点的R矿和U矿的数量, 求最大运送的矿石数目(履带车会一直走到边界)

思路：

（1）若一旦确定取该格子的矿U矿，则该格子左侧的都要取U矿；

（2）若一旦确定取该格子的矿R矿，则该格子上侧的都要取R矿；

这个dp[i][j]，1,1到i，j这个矩形里最大的采矿量，一加只能加一行或者一列，看这个矩阵是+行最优还是+列最优。。这题的预处理很好，值得学习。。这种dp也是第一次遇到，原来写了一发，不明所以、、还是菜

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn = 505;
int dp[maxn][maxn], a[maxn][maxn], b[maxn][maxn];
int main()
{
    int t, n, m, Case = 0;
    scanf("%d", &t);
    while(t--)
    {
        memset(dp, 0, sizeof(dp));
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
            scanf("%d", &a[i][j]), a[i][j] +=  a[i][j-1]; //记录这一行前面所有列的矿量
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
            scanf("%d", &b[i][j]), b[i][j] += b[i-1][j]; //记录这一列前面所有行的矿量
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= m; j++)
            dp[i][j] = max(dp[i][j-1] + b[i][j], dp[i-1][j] + a[i][j]); //看是加行最优还是加列最优
        printf("Case %d: %d\n", ++Case, dp[n][m]);
    }
    return 0;
}