oj.uz

Submission #440322

# Submission time Handle Problem Language Result Execution time Memory
440322 2021-07-02T04:55:37 Z dxz05 Raisins (IOI09_raisins) C++14
100 / 100
 1604 ms 59592 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 55;

int arr[55][55];

long long dp[55][55][55][55];
long long calc(int a, int b, int c, int d){
    if (dp[a][b][c][d] != -1) return dp[a][b][c][d];
    if (a == c && b == d) return dp[a][b][c][d] = 0;
    if (a > c || b > d) return dp[a][b][c][d] = 2e9;

    dp[a][b][c][d] = 2e9;
    for (int i = a; i < c; i++){
        dp[a][b][c][d] = min(dp[a][b][c][d], calc(a, b, i, d) + calc(i + 1, b, c, d));
    }

    for (int i = b; i < d; i++){
        dp[a][b][c][d] = min(dp[a][b][c][d], calc(a, b, c, i) + calc(a, i + 1, c, d));
    }

    for (int i = a; i <= c; i++){
        for (int j = b; j <= d; j++){
            dp[a][b][c][d] += arr[i][j];
        }
    }

    //cout << a << ' ' << b << ' ' << c << ' ' << d << ' ' << dp[a][b][c][d] << endl;

    return dp[a][b][c][d];
}

int main(){
    int n, m;
    cin >> n >> m;

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            cin >> arr[i][j];
        }
    }

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= m; j++){
            for (int ii = 1; ii <= n; ii++){
                for (int jj = 1; jj <= m; jj++){
                    dp[i][j][ii][jj] = -1;
                }
            }
        }
    }

    cout << calc(1, 1, n, m);

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 2 ms 1612 KB Output is correct
8 Correct 15 ms 5068 KB Output is correct
9 Correct 29 ms 7792 KB Output is correct
10 Correct 40 ms 9420 KB Output is correct
11 Correct 33 ms 7500 KB Output is correct
12 Correct 142 ms 17832 KB Output is correct
13 Correct 224 ms 23504 KB Output is correct
14 Correct 56 ms 9548 KB Output is correct
15 Correct 290 ms 26700 KB Output is correct
16 Correct 22 ms 9164 KB Output is correct
17 Correct 107 ms 19628 KB Output is correct
18 Correct 768 ms 45992 KB Output is correct
19 Correct 1247 ms 56132 KB Output is correct
20 Correct 1604 ms 59592 KB Output is correct