oj.uz

Submission #239361

# Submission time Handle Problem Language Result Execution time Memory
239361 2020-06-15T12:42:58 Z DavidDamian Raisins (IOI09_raisins) C++11
100 / 100
 743 ms 30188 KB 
#include <bits/stdc++.h>
using namespace std;
int n,m;
int A[55][55];
int sum[55][55];
int memo[55][55][55][55];
int getSum(int i,int j,int a,int b)
{
    int total=sum[j][b]-sum[j][a-1]-sum[i-1][b]+sum[i-1][a-1];
    return total;
}
int DivideConquer(int i,int j,int a,int b)
{
    if(i==j && a==b)
        return 0;
    if(memo[i][j][a][b]==-1){
        int minimum=INT_MAX;
        for(int i_nxt=i;i_nxt<j;i_nxt++){
            minimum=min(minimum,DivideConquer(i,i_nxt,a,b)
                        +DivideConquer(i_nxt+1,j,a,b)
                        +getSum(i,j,a,b));
        }
        for(int a_nxt=a;a_nxt<b;a_nxt++){
            minimum=min(minimum,DivideConquer(i,j,a,a_nxt)
                        +DivideConquer(i,j,a_nxt+1,b)
                        +getSum(i,j,a,b));
        }
        memo[i][j][a][b]=minimum;
    }
    return memo[i][j][a][b];
}
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            for(int a=1;a<=m;a++){
                for(int b=1;b<=m;b++){
                    memo[i][j][a][b]=-1;
                }
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>A[i][j];
            sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+A[i][j];
        }
    }
    int total=DivideConquer(1,n,1,m);
    cout<<total<<'\n';
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 5 ms 1024 KB Output is correct
7 Correct 7 ms 1536 KB Output is correct
8 Correct 14 ms 3200 KB Output is correct
9 Correct 21 ms 5376 KB Output is correct
10 Correct 31 ms 6272 KB Output is correct
11 Correct 24 ms 4480 KB Output is correct
12 Correct 79 ms 11264 KB Output is correct
13 Correct 136 ms 14456 KB Output is correct
14 Correct 37 ms 5376 KB Output is correct
15 Correct 170 ms 16384 KB Output is correct
16 Correct 20 ms 9856 KB Output is correct
17 Correct 84 ms 15232 KB Output is correct
18 Correct 422 ms 26744 KB Output is correct
19 Correct 637 ms 27896 KB Output is correct
20 Correct 743 ms 30188 KB Output is correct