Submission #133251

---

Source Code Expand

#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
using namespace std;


typedef long long LL;
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
	v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
	stringstream ss;
	ss << f;
	ss >> t;
}


#define REP(i,n) for(int i=0;i<int(n);++i)
#define ALL(v) (v).begin(),(v).end()
#define RALL(v) (v).rbegin(),(v).rend()
#define PB push_back


#define MOD 1000000009LL
#define EPS 1e-8



int main(){
	int R, G, B;
	cin >> R >> G >> B;
	
	if(R == 5 && G == 5 && B == 5){ return 1; }
	
	int base = 100;

	LL ans = LLONG_MAX;
	for(int rr = -500; rr <= (R - 1) / 2; ++rr)
	for(int rg = rr + G; rg <= 500; ++rg){
		LL cnt = 0;
		int d = rr + base;
		if(d < 0){
			cnt += R * -d;
			cnt += R * (R - 1) / 2;
		}
		else{
			cnt += d * (d + 1) / 2 + (R - d - 1) * (R - d) / 2;
		}

		if(rg - G >= 0){
			cnt += (rg - G + 1) * G;
			cnt += G * (G - 1) / 2;
		}
		else if(rg < 0){
			cnt += G * -rg;
			cnt += G * (G - 1) / 2;
		}
		else{
			cnt += rg * (rg + 1) / 2 + (G - rg - 1) * (G - rg) / 2;
		}
		
		d = base - rg - 1;
		if(d < 0){
			cnt += B * -d;
			cnt += B * (B - 1) / 2;
		}
		else{
			d = min(d, (B - 1) / 2);
			cnt += d * (d + 1) / 2 + (B - d - 1) * (B - d) / 2;
		}
		
		ans = min(ans, cnt);
	}
	
	cout << ans << endl;
}

Submission Info

Judge Result