#26277 (Java21) No.198 キャンディー・ボックス２

• 問題: No.198 キャンディー・ボックス２
• ユーザー: threepipes_s
• 提出日時: 2015-05-12 12:21:38
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 76 ms / 1,000 ms
• コード長: 3,292 bytes
• コンパイル時間: 2,629 ms
• コンパイル使用メモリ: 82,096 KB
• 実行使用メモリ: 38,312 KB
• 最終ジャッジ日時: 2024-04-28 01:09:18
• 合計ジャッジ時間: 5,684 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	71 ms; 38,060 KB
testcase_01	AC	74 ms; 38,260 KB
testcase_02	AC	72 ms; 37,732 KB
testcase_03	AC	74 ms; 38,188 KB
testcase_04	AC	74 ms; 38,020 KB
testcase_05	AC	72 ms; 38,200 KB
testcase_06	AC	74 ms; 38,108 KB
testcase_07	AC	72 ms; 37,888 KB
testcase_08	AC	75 ms; 37,936 KB
testcase_09	AC	72 ms; 38,312 KB
testcase_10	AC	69 ms; 37,960 KB
testcase_11	AC	72 ms; 37,732 KB
testcase_12	AC	73 ms; 38,224 KB
testcase_13	AC	71 ms; 38,200 KB
testcase_14	AC	72 ms; 37,720 KB
testcase_15	AC	72 ms; 38,260 KB
testcase_16	AC	72 ms; 38,132 KB
testcase_17	AC	73 ms; 38,016 KB
testcase_18	AC	74 ms; 38,124 KB
testcase_19	AC	73 ms; 38,100 KB
testcase_20	AC	72 ms; 38,052 KB
testcase_21	AC	72 ms; 38,060 KB
testcase_22	AC	72 ms; 37,760 KB
testcase_23	AC	76 ms; 38,140 KB
testcase_24	AC	75 ms; 37,928 KB
testcase_25	AC	73 ms; 37,988 KB
testcase_26	AC	75 ms; 38,160 KB
testcase_27	AC	74 ms; 38,060 KB
testcase_28	AC	72 ms; 37,636 KB
testcase_29	AC	75 ms; 37,944 KB

ソースコード

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Comparator;
import java.util.HashSet;

public class Main {
	public static int b;
	public static void main(String[] args) throws NumberFormatException,
	IOException {
		ContestScanner in = new ContestScanner();
		b = in.nextInt();
		int n = in.nextInt();
		int[] c = new int[n];
		for(int i=0; i<n; i++){
			c[i] = in.nextInt();
		}
		System.out.println(triSearchMin(c));
	}
	
	public static long triSearchMin(int[] c){
		int left = 0;
		int right = (int)1e9;
		while(left < right - 10){
			int id1 = left + (right-left)/3;
			int id2 = left + (right-left)*2/3;
			if(f(c, id1) > f(c, id2)){
				left = id1;
			}else{
				right = id2;
			}
		}
		long res = (long)1e12;
		for(int i=left; i<=right; i++){
			long tmp = f(c, i);
			if(tmp < res) res = tmp;
		}
		
		for(int i=Math.max(left-10, 0); i<= Math.min(right+10, 1e9); i++){
			System.err.println(f(c, i));
		}
		System.err.println("left :"+left);
		System.err.println("right:"+right);
		System.err.flush();
		return res;
	}
	
	public static long f(int[] c, int line){
		long res = 0;
		long need = 0;
		for(int i=0; i<c.length; i++){
			res += Math.abs(c[i]-line);
			need += c[i]-line;
		}
		if(need + b < 0) return (long)1e12;
		return res;
	}
}

class Node{
	int id;
	HashSet<Node> edge = new HashSet<Node>();
	public Node(int id) {
		this.id = id;
	}
	public void createEdge(Node node) {
		edge.add(node);
	}
}

class MyComp implements Comparator<int[]> {
	final int idx;
	public MyComp(int idx){
		this.idx = idx;
	}
	public int compare(int[] a, int[] b) {
		return a[idx] - b[idx];
	}
}

class Reverse implements Comparator<Integer> {
	public int compare(Integer arg0, Integer arg1) {
		return arg1 - arg0;
	}
}


class ContestWriter {
	private PrintWriter out;

	public ContestWriter(String filename) throws IOException {
		out = new PrintWriter(new BufferedWriter(new FileWriter(filename)));
	}

	public ContestWriter() throws IOException {
		out = new PrintWriter(System.out);
	}

	public void println(String str) {
		out.println(str);
	}

	public void print(String str) {
		out.print(str);
	}

	public void close() {
		out.close();
	}
}

class ContestScanner {
	private BufferedReader reader;
	private String[] line;
	private int idx;

	public ContestScanner() throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(System.in));
	}

	public ContestScanner(String filename) throws FileNotFoundException {
		reader = new BufferedReader(new InputStreamReader(new FileInputStream(
				filename)));
	}

	public String nextToken() throws IOException {
		if (line == null || line.length <= idx) {
			line = reader.readLine().trim().split(" ");
			idx = 0;
		}
		return line[idx++];
	}

	public long nextLong() throws IOException, NumberFormatException {
		return Long.parseLong(nextToken());
	}

	public int nextInt() throws NumberFormatException, IOException {
		return (int) nextLong();
	}

	public double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}
}