oj.uz

답안 #856137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
856137 2023-10-02T17:31:12 Z Irate 건포도 (IOI09_raisins) C++14
100 / 100
 455 ms 29096 KB 
#include<bits/stdc++.h>
using namespace std;
const int mxN = 52;
int grid[mxN][mxN], pref[mxN][mxN], dp[mxN][mxN][mxN][mxN];
int rec(int x1, int y1, int x2, int y2){
    int sum = pref[x2][y2] - pref[x1 - 1][y2] - pref[x2][y1 - 1] + pref[x1 - 1][y1 - 1], res = 1e9;
    if(x1 == x2 && y1 == y2)return 0;
    if(dp[x1][y1][x2][y2] != -1)return dp[x1][y1][x2][y2];
    for(int i = x1 + 1;i <= x2;++i){
        res = min(res, sum + rec(i, y1, x2, y2) + rec(x1, y1, i - 1, y2));
    }
    for(int i = y1 + 1;i <= y2;++i){
        res = min(res, sum + rec(x1, y1, x2, i - 1) + rec(x1, i, x2, y2));
    }
    return dp[x1][y1][x2][y2] = res;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m;
    cin >> n >> m;
    for(int i = 0;i < mxN;++i){
        for(int j = 0;j < mxN;++j){
            for(int k = 0;k < mxN;++k){
                for(int l = 0;l < mxN;++l){
                    dp[i][j][k][l] = -1;
                }
            }
        }
    }
    for(int i = 1;i <= n;++i){
        for(int j = 1;j <= m;++j){
            cin >> grid[i][j];
            pref[i][j] = pref[i - 1][j] + pref[i][j - 1] + grid[i][j] - pref[i - 1][j - 1];
        }
    }
    cout << rec(1, 1, n, m);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 29016 KB Output is correct
2 Correct 4 ms 29016 KB Output is correct
3 Correct 4 ms 28880 KB Output is correct
4 Correct 5 ms 29020 KB Output is correct
5 Correct 4 ms 29016 KB Output is correct
6 Correct 4 ms 29020 KB Output is correct
7 Correct 4 ms 29020 KB Output is correct
8 Correct 9 ms 29020 KB Output is correct
9 Correct 14 ms 29020 KB Output is correct
10 Correct 20 ms 29072 KB Output is correct
11 Correct 16 ms 29020 KB Output is correct
12 Correct 48 ms 29020 KB Output is correct
13 Correct 77 ms 29016 KB Output is correct
14 Correct 24 ms 29096 KB Output is correct
15 Correct 93 ms 29020 KB Output is correct
16 Correct 11 ms 29020 KB Output is correct
17 Correct 40 ms 29020 KB Output is correct
18 Correct 229 ms 29084 KB Output is correct
19 Correct 367 ms 29092 KB Output is correct
20 Correct 455 ms 29092 KB Output is correct