oj.uz

Submission #659360

# Submission time Handle Problem Language Result Execution time Memory
659360 2022-11-17T14:36:12 Z Trisanu_Das Raisins (IOI09_raisins) C++17
100 / 100
 253 ms 20968 KB 
#include <bits/stdc++.h>
using namespace std;
 
int dp[51][51][51][51], a[51][51], pref[51][51];
 
int main() {
    int n, m; cin >> n >> m;
    for(int i = 1; i < n + 1; i++) for(int j = 1; j < m + 1; j++){
        cin >> a[i][j];
        pref[i][j] = pref[i - 1][j] + pref[i][j - 1] + a[i][j] - pref[i - 1][j - 1];
    }
 
    for(int i = 1; i < n + 1; i++) for(int j = 1; j < m + 1; j++) for(int k = 1; k < n - i + 2; k++) for(int l = 1;  l < m - j + 2; l++) {
        if (i == 1 && j == 1) continue;
        int mn = INT_MAX;
        for(int x = 1; x < i; x++) mn = min(mn, dp[k][l][x][j] + dp[k + x][l][i - x][j]);
        for(int x = 1; x < j; x++) mn = min(mn, dp[k][l][i][x] + dp[k][l + x][i][j - x]);
        dp[k][l][i][j] = mn + pref[k + i - 1][l + j - 1] + pref[k - 1][l - 1] - pref[k + i - 1][l - 1] - pref[k - 1][l + j - 1];
    }
    cout << dp[1][1][n][m];
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 852 KB Output is correct
8 Correct 3 ms 2644 KB Output is correct
9 Correct 5 ms 3540 KB Output is correct
10 Correct 7 ms 4344 KB Output is correct
11 Correct 5 ms 3796 KB Output is correct
12 Correct 17 ms 7380 KB Output is correct
13 Correct 29 ms 9336 KB Output is correct
14 Correct 7 ms 4564 KB Output is correct
15 Correct 35 ms 10220 KB Output is correct
16 Correct 4 ms 3540 KB Output is correct
17 Correct 17 ms 7312 KB Output is correct
18 Correct 132 ms 15948 KB Output is correct
19 Correct 203 ms 19548 KB Output is correct
20 Correct 253 ms 20968 KB Output is correct