Submission #337357

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<limits.h>
#define LL long long
#define rep(i,a,b) for (LL (i)=(a);(i)<(b);(i)++)
using namespace std;
LL sigma[10000];

struct Marble{
	LL t;
	LL l, r;
};
Marble m[3];

void init(){
	sigma[0] = 0;
	rep(i, 0, 10000)sigma[i] = sigma[i - 1] + i;
}

LL calc(){
	LL result = 0;
	rep(i, 0, 3){
		/*
		result += abs(m[i].l)*(m[i].l + 1);
		result += abs(m[i].r)*(m[i].r + 1);
		*/
		
		result += (m[i].l >= 0) ? sigma[m[i].l] : -sigma[-m[i].l - 1];
		result += (m[i].r >= 0) ? sigma[m[i].r] : -sigma[-m[i].r - 1];
		
	}
	return(result);
}

int main(void){
	init();
	rep(i, 0, 3){
		cin >> m[i].t;
		m[i].t--;
	}
	LL res =INT_MAX;
	rep(i, -900, 901){
		m[0].l = i;
		m[0].r = m[0].t - i;
		rep(j, -m[0].r, 100-m[0].r){
			m[1].l = j;
			m[1].r = m[1].t - j;
				rep(k, -m[1].r, 100 - m[1].r){
				m[2].l = k;
				m[2].r = m[2].t - k;
					res = min(res, calc());
				
			}
		}
	}
	cout << res <<  endl;
}

Submission Info

Judge Result