Submission #2214095

---

Source Code Expand

#include <algorithm>
#include <iostream>

#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(a) (a).begin(), (a).end()

#define INF 10000000
#define MOD 1000000007

#define MIN -1000
#define MAX 1000

#define R_POS (-100)
#define G_POS 0
#define B_POS 100

using namespace std;

int calcCost(int start, int end, int center) {
    int left = center - start;
    int right = end - center - 1;

    int left_cost = left * (left + 1) / 2;
    int right_cost = right * (right + 1) / 2;

    int cost = 0;
    if (start <= center)
        cost += left_cost;
    else
        cost -= left_cost;

    if (center < end)
        cost += right_cost;
    else
        cost -= right_cost;

    return cost;
}

/*
int main(void) {
    int x, y;
    cin >> x >> y;

    cout << calcCost(x, y, 0) << endl;

    return 0;
}
*/

int main() {
    int R, G, B;
    cin >> R >> G >> B;

    int result = INF;

    for (int g = MIN; g <= MAX; g++) {
        int g_start = g;    // Gの座標の最小値
        int g_end = g + G;  // Gの上界

        int g_cost = calcCost(g_start, g_end, 0);

        int r_cost = INF;
        for (int r = MIN; r + R <= g_start; r++) {
            int r_start = r;
            int r_end = r + R;

            int cost = calcCost(r_start, r_end, -100);
            r_cost = std::min(cost, r_cost);
        }

        int b_cost = INF;
        for (int b = g_end; b + B <= MAX; b++) {
            int b_start = b;
            int b_end = b + B;

            int cost = calcCost(b_start, b_end, 100);
            b_cost = std::min(cost, b_cost);
        }

        int sum = g_cost + r_cost + b_cost;
        result = std::min(sum, result);
    }

    cout << result << endl;

    return 0;
}

Submission Info

Judge Result