oj.uz

답안 #542237

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
542237 2022-03-25T21:47:18 Z Iwanttobreakfree 건포도 (IOI09_raisins) C++
100 / 100
 132 ms 26800 KB 
#include <iostream>
#include <vector>
using namespace std;
const int N=51;
int dp[N][N][N][N];
int pr[N][N];
int DP(int rl,int rr,int cl,int cr){
    if(dp[rl][rr][cl][cr]!=-1)return dp[rl][rr][cl][cr];
    int ans=1e9;
    int r=pr[rr][cr]-pr[rr][cl-1]-pr[rl-1][cr]+pr[rl-1][cl-1];
    for(int i=rl;i<rr;i++){
        ans=min(ans,DP(rl,i,cl,cr)+DP(i+1,rr,cl,cr));
    }
    for(int i=cl;i<cr;i++){
        ans=min(ans,DP(rl,rr,cl,i)+DP(rl,rr,i+1,cr));
    }
    if(ans==1e9)ans=r=0;
    //cout<<rl<<' '<<rr<<' '<<cl<<' '<<cr<<' '<<ans+r<<'\n';
    return dp[rl][rr][cl][cr]=r+ans;
}
int main(){
    int n,m;
    cin>>n>>m;
    for(int i=0;i<N;i++)for(int j=0;j<N;j++)for(int q=0;q<N;q++)for(int k=0;k<N;k++)dp[i][j][q][k]=-1;
    for(int i=0;i<N;i++)for(int j=0;j<N;j++)pr[i][j]=0;
    int grid[n][m];
    for(int i=0;i<n;i++)for(int j=0;j<m;j++)cin>>grid[i][j];
    for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)pr[i][j]=pr[i-1][j]+pr[i][j-1]+grid[i-1][j-1]-pr[i-1][j-1];
    cout<<DP(1,n,1,m);
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 26708 KB Output is correct
2 Correct 10 ms 26680 KB Output is correct
3 Correct 13 ms 26800 KB Output is correct
4 Correct 10 ms 26708 KB Output is correct
5 Correct 11 ms 26756 KB Output is correct
6 Correct 10 ms 26708 KB Output is correct
7 Correct 11 ms 26708 KB Output is correct
8 Correct 12 ms 26708 KB Output is correct
9 Correct 12 ms 26708 KB Output is correct
10 Correct 16 ms 26708 KB Output is correct
11 Correct 15 ms 26708 KB Output is correct
12 Correct 24 ms 26680 KB Output is correct
13 Correct 35 ms 26708 KB Output is correct
14 Correct 17 ms 26728 KB Output is correct
15 Correct 38 ms 26788 KB Output is correct
16 Correct 13 ms 26676 KB Output is correct
17 Correct 22 ms 26676 KB Output is correct
18 Correct 80 ms 26708 KB Output is correct
19 Correct 115 ms 26708 KB Output is correct
20 Correct 132 ms 26800 KB Output is correct