oj.uz

Submission #395087

# Submission time Handle Problem Language Result Execution time Memory
395087 2021-04-27T17:48:49 Z MarcoMeijer Raisins (IOI09_raisins) C++14
100 / 100
 192 ms 13520 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 51;
const int N = (1<<20);

int n, m;
int cnt[MX][MX];
int dp[MX][MX][MX][MX];

void program() {
    IN(n,m);
    RE(i,MX) RE(j,MX) cnt[i][j] = 0;
    RE(i,n) RE(j,m) cin>>cnt[i+1][j+1];
    RE(i,n+1) RE(j,m+1) {
        if(i   ) cnt[i][j] += cnt[i-1][j  ];
        if(   j) cnt[i][j] += cnt[i  ][j-1];
        if(i&&j) cnt[i][j] -= cnt[i-1][j-1];
    }
    RE1(w,n) RE1(h,m) RE(l,n-w+1) RE(u,m-h+1) {
        int r = l+w-1;
        int d = u+h-1;
        if(l == r && u == d) {
            dp[l][r][u][d] = 0;
        } else {
            int res = 1e9;
            REP(x,l,r) res = min(res, dp[l][x][u][d] + dp[x+1][r][u][d]);
            REP(y,u,d) res = min(res, dp[l][r][u][y] + dp[l][r][y+1][d]);
            dp[l][r][u][d] = res + cnt[r+1][d+1] - cnt[l][d+1] - cnt[r+1][u] + cnt[l][u];
        }
    }
    cout<<dp[0][n-1][0][m-1]<<endl;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 972 KB Output is correct
8 Correct 2 ms 1740 KB Output is correct
9 Correct 4 ms 2764 KB Output is correct
10 Correct 5 ms 3148 KB Output is correct
11 Correct 4 ms 2380 KB Output is correct
12 Correct 14 ms 5580 KB Output is correct
13 Correct 25 ms 6764 KB Output is correct
14 Correct 6 ms 2636 KB Output is correct
15 Correct 31 ms 7516 KB Output is correct
16 Correct 6 ms 5044 KB Output is correct
17 Correct 16 ms 7592 KB Output is correct
18 Correct 101 ms 11840 KB Output is correct
19 Correct 176 ms 12364 KB Output is correct
20 Correct 192 ms 13520 KB Output is correct