제출 #415268

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
415268	2021-05-31 18:59:07	Antekb	건포도 (IOI09_raisins)	C++14	100 / 100	368 ms	52664 KiB

raisins

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
const int N=51;
long long dp[N][N][N][N], sum[N][N][N][N];
int tab[N][N];
int main(){
    int n, m;
    cin>>n>>m;
    for(int i=0; i<n; i++){
        for(int j=0; j<m;j ++){
            cin>>sum[i][i][j][j];
        }
    }
    for(int d1=0; d1<n; d1++){
        for(int i=0; i<n-d1; i++){
            for(int d2=0; d2<m; d2++){
                for(int j=0; j<m-d2; j++){
                    if(d1==0 && d2==0)continue;
                    dp[i][i+d1][j][j+d2]=1e18;
                    if(d1){
                        sum[i][i+d1][j][j+d2]=sum[i][i][j][j+d2]+sum[i+1][i+d1][j][j+d2];
                        for(int k=0; k<d1; k++){
                            dp[i][i+d1][j][j+d2]=min(dp[i][i+d1][j][j+d2], dp[i][i+k][j][j+d2]+dp[i+k+1][i+d1][j][j+d2]);
                        }
                    }
                    if(d2){
                        sum[i][i+d1][j][j+d2]=sum[i][i+d1][j][j]+sum[i][i+d1][j+1][j+d2];
                        for(int k=0; k<d2; k++){
                            dp[i][i+d1][j][j+d2]=min(dp[i][i+d1][j][j+d2], dp[i][i+d1][j][j+k]+dp[i][i+d1][j+k+1][j+d2]);
                        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100