Submission #1894038

---

Source Code Expand

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

//宣言
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;

//数値
#define MOD 1000000007
#define INF (1<<20)
const double EPS = 1e-10;
const double PI = acos(-1.0);

//操作
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define REP(i,n) FOR(i,0,n)
#define REPB(i,n) for(int i=n;i>=0;--i)
#define SORT(A) sort(A,A+sizeof(A)/sizeof(A[0]))
#define VSORT(A) sort(A.begin(),A.end())
#define EXIST(s,e) (s.find(e)!=s.end())
#define PB push_back
#define MP make_pair

//DEBUG
//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;


int main() {
	int r, g, b;
	cin >> r >> g >> b;

	int dp[2000][903] = {{0}};
	int sum;
	sum= r + g + b;

	REP(i, 2000) REP(j, sum + 1) {
		if (j) dp[i][j] = INF;
	}

	FOR(i, 1, 2000) {
		FOR(j, 1, sum + 1) {
			int M;
			if (j <= r) M = abs(i - 900);
			else if (j <= r + g) M = abs(i - 1000);
			else M = abs(i - 1100);
			dp[i][j] = min(dp[i - 1][j - 1] + M, dp[i - 1][j]);
		}

	}

	cout << dp[1999][sum] << endl;

}

Submission Info

Judge Result