Submission #386422

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
using namespace std;
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
typedef pair<int, int> P;
typedef long long ll;
typedef unsigned long long ull;

#define For(i,a,b)	for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define rall(a)		(a).rbegin(), (a).rend()
#define sz(a)		(sizeof(a))
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
const int dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };
const int mod = 5;
const int INF = 1e9;

int dp[2000][1000];
int main()
{
	int r, g, b;
	cin >> r >> g >> b;
	//1000を原点とする

	int m = r + g + b;
	Fill(dp, INF);
	dp[0][m] = 0;
	
	For(i,1, 2000){
		for (int j = m; j >= 0; j--){
			int t;
			if (j >= g + b)t = abs( 900 - i);else
			if (j >= b)    t = abs(1000 - i);else
						  t = abs(1100 - i);
			dp[i][j] = min(dp[i - 1][j], dp[i][j]);
			dp[i][j] = min(dp[i-1][j+1]+t,dp[i][j]);
		}
	}
	
	int ans = INF;
	For(i, 1, 2000){
		ans = min(dp[i][0], ans);
	}
	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result