Submission #6902629

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(x) (x).begin(),(x).end()
const int IINF = 1e9;
const LL LINF = 1e18;
const LL mod = 1e9+7;

LL dfs(LL **dp, LL pos, LL left, LL R, LL G, LL B) {
    if(left <= 0) {
        return 0;
    }
    if(2000 <= pos + left) {
        return 1145141919;
    }
    if(0 <= dp[pos][left] && dp[pos][left - 1]) {
        return min(dp[pos][left], dp[pos][left - 1]);
    }
    LL c = left <= B ? 1100 : left <= G + B ? 1000 : 900;
    dp[pos][left - 1] = abs(c - pos) + dfs(dp, pos + 1, left - 1, R, G, B);
    dp[pos][left] = dfs(dp, pos + 1, left, R, G, B);
    return min(dp[pos][left], dp[pos][left - 1]);
}

int main() {
    LL R, G, B;
    cin >> R >> G >> B;

    LL **dp;
    dp = new LL*[2000];
    REP(i, 2000) {
        dp[i] = new LL[R + G + B + 1];
    }
    REP(i, 2000) {
        fill(dp[i], dp[i] + R + G + B + 1, -1);
    }

    LL res = dfs(dp, 0, R + G + B, R, G, B);
    cout << res << endl;
    return 0;
}

Submission Info

Judge Result