Submission #1511515

---

Source Code Expand

import std.stdio;
import std.range;
import std.algorithm;
import std.format;
import std.bigint;
import std.functional;
import std.string;

void main()
{
	int R, G, B;
	string input = readln();
	input.formattedRead("%s %s %s", &R, &G, &B);

	if (R <= 40 && G <= 40 && B <= 40)
	{
		solve_40(R, G, B).writeln();
		return;
	}
	else
	{
		solve(R, G, B).writeln();
		return;
	}
	assert(0);
}

int solve(int r, int g, int b)
{
	int answer = int.max;

	foreach (i; -1000 .. 1000)
	{
		int gleft = i - (g / 2);
		int gright = gleft + g;

		int eg = expand(0, g, gleft);
		int er = expand(-100, r, min(-100 - (r / 2), gleft - r));
		int eb = expand(100, b, min(100 - (b / 2), gright));

		answer = min(answer, er + eg + eb);
	}
	return answer;
}

int solve_40(int r, int g, int b)
{
	int er = expand(-100, r, -100 - (r / 2));
	int eg = expand(0, g, -(g / 2));
	int eb = expand(100, b, 100 - (b / 2));
	//format("%s %s %s", er, eg, eb).writeln();
	return er + eg + eb;
}

int expand(int o, int n, int left)
{
	if (o <= left)
	{
		assert(((2 * (left - o) + n - 1) * n) % 2 == 0);
		return (2 * (left - o) + n - 1) * n / 2;
	}
	else if (left + n - 1 <= o)
	{
		assert(((2 * (o - left) - n + 1) * n) % 2 == 0);
		return (2 * (o - left) - n + 1) * n / 2;
	}
	else
	{
		int a = o - left;
		int b = left + n - o - 1;
		int sum_a = a * (a + 1) / 2;
		int sum_b = b * (b + 1) / 2;
		return sum_a + sum_b;
	}
}

Submission Info

Judge Result