oj.uz

Submission #998640

# Submission time Handle Problem Language Result Execution time Memory
998640 2024-06-14T11:58:23 Z bachhoangxuan Raisins (IOI09_raisins) C++17
100 / 100
 189 ms 22748 KB 
#include<bits/stdc++.h>
using namespace std;
const int maxn = 55;
const int inf = 1e9;
int n,m,p[maxn][maxn];
int f(int x,int y,int u,int v){
    return p[u][v]-p[x-1][v]-p[u][y-1]+p[x-1][y-1];
}
int dp[maxn][maxn][maxn][maxn];
int g(int x,int y,int u,int v){
    if(x==u && y==v) return 0;
    if(dp[x][y][u][v]) return dp[x][y][u][v];
    int res=inf,val=f(x,y,u,v);
    for(int i=x;i<u;i++) res=min(res,val+g(x,y,i,v)+g(i+1,y,u,v));
    for(int i=y;i<v;i++) res=min(res,val+g(x,y,u,i)+g(x,i+1,u,v));
    return dp[x][y][u][v]=res;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    cin >> n >> m;
    for(int i=1;i<=n;i++) for(int j=1;j<=m;j++) cin >> p[i][j],p[i][j]+=p[i-1][j]+p[i][j-1]-p[i-1][j-1];
    cout << g(1,1,n,m) << '\n';
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 1 ms 1116 KB Output is correct
8 Correct 3 ms 2908 KB Output is correct
9 Correct 5 ms 3788 KB Output is correct
10 Correct 9 ms 4564 KB Output is correct
11 Correct 7 ms 3932 KB Output is correct
12 Correct 22 ms 7788 KB Output is correct
13 Correct 32 ms 9812 KB Output is correct
14 Correct 11 ms 4700 KB Output is correct
15 Correct 44 ms 10960 KB Output is correct
16 Correct 5 ms 3932 KB Output is correct
17 Correct 27 ms 7728 KB Output is correct
18 Correct 98 ms 17424 KB Output is correct
19 Correct 159 ms 21076 KB Output is correct
20 Correct 189 ms 22748 KB Output is correct