Submission #3717357

---

Source Code Expand

import java.util.*;
public class Main {
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
	// 整数の入力
	int r = sc.nextInt();
	int g = sc.nextInt();
	int b = sc.nextInt();

	//GreenとRedの間(中心を除く)の和
	int sumGR = (g-1)/2 + (r-1)/2;
	int sumGB = (g-1)/2 + (b-1)/2;

	int result = 0;
	int tmp,hogered;
	int hogegreen = -100;
	//間の和が100未満かどうかの4通りで場合分け
	if(sumGR < 100 && sumGB < 100){	//それぞれ干渉しない
	    result = count(r) + count(g) + count(b);
	} else { //両方あふれて、左右にずれる
	    result = countOperation(g, -300 ,0) + countOperation(r, -300-r, -100) + countOperation(b, -300+g, 100);
	    for(int greenLeft = -300; greenLeft < 0; ++greenLeft){
		int redLeft = greenLeft - r;
		int blueLeft = greenLeft + g;
		tmp = countOperation(g, greenLeft ,0) + countOperation(r, redLeft, -100) + countOperation(b, blueLeft, 100);
		if(tmp < result){
		    result = tmp;
		    hogegreen = greenLeft;
		}
	    }
	}
 
	System.out.println(result);
	//	System.out.println(hogegreen);
    }

    //展開するときの個数を入れると回数を返す
    public static int count(int num){
	if(num == 2){
	    return 1;
	} else if(num == 1){
	    return 0;
	} else {
	    return count(num-1) + num/2;
	}
    }

    //展開するときの個数と左端、中心を入れると回数を返す
    public static int countOperation(int num, int left, int center){
	int result = 0;
	for(int i = 0; i < num; ++i){
	    result += Math.abs(center - left - i);
	}
	return result;
    }
}

Submission Info

Judge Result