제출 #547654

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
547654		chirathnirodha	건포도 (IOI09_raisins)	C++17	100 / 100	180 ms	49288 KiB

raisins

//Coded by Chirath Nirodha
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define I insert
#define P push
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_tree;
const ll mod=1e9+7;
inline void io(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
ll n,m;
ll ras[50][50];
ll dp[50][50][50][50];
ll rassum[50][50];
void calc(int x1,int y1,int x2,int y2){
    if(x1==x2 && y1==y2){dp[x1][y1][x2][y2]=0;return;}
    ll temp=INT64_MAX;
    ll sum=0;
    for(int i=x1;i<x2;i++){
        sum+=rassum[i][y2];
        if(y1>0)sum-=rassum[i][y1-1];
        if(dp[x1][y1][i][y2]==-1)calc(x1,y1,i,y2);
        if(dp[i+1][y1][x2][y2]==-1)calc(i+1,y1,x2,y2);
        temp=min(temp,dp[x1][y1][i][y2]+dp[i+1][y1][x2][y2]);
    }
    sum+=rassum[x2][y2];
    if(y1>0)sum-=rassum[x2][y1-1];
    for(int i=y1;i<y2;i++){
        if(dp[x1][y1][x2][i]==-1)calc(x1,y1,x2,i);
        if(dp[x1][i+1][x2][y2]==-1)calc(x1,i+1,x2,y2);
        temp=min(temp,dp[x1][y1][x2][i]+dp[x1][i+1][x2][y2]);
    }
    dp[x1][y1][x2][y2]=temp+sum;
}
void solve(){
    io();
    cin>>n>>m;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            cin>>ras[i][j];
            rassum[i][j]=ras[i][j];
            if(j>0)rassum[i][j]+=rassum[i][j-1];
        }
    }
    memset(dp,-1,sizeof(dp));
    calc(0,0,n-1,m-1);
    cout<<dp[0][0][n-1][m-1]<<endl;
}
int main(){
    io();
    solve();
}

• Subtask 1: 100 / 100