結果

問題 No.198 キャンディー・ボックス２
コンテスト
ユーザー threepipes_s
提出日時 2015-05-12 12:08:42
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 3,083 bytes
コンパイル時間 2,567 ms
コンパイル使用メモリ 79,968 KB
実行使用メモリ 52,332 KB
最終ジャッジ日時 2024-07-06 00:04:25
合計ジャッジ時間 5,277 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 15 WA * 11
権限があれば一括ダウンロードができます

ソースコード

diff # 

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 = (int)1e9;
		for(int i=left; i<=right; i++){
			long tmp = f(c, i);
			if(tmp < res) res = tmp;
		}
		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 (int)1e9;
		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());
	}
}
0