結果

問題 No.198 キャンディー・ボックス２
ユーザー threepipes_sthreepipes_s
提出日時 2015-05-12 12:21:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 77 ms / 1,000 ms
コード長 3,292 bytes
コンパイル時間 2,791 ms
コンパイル使用メモリ 80,884 KB
実行使用メモリ 37,884 KB
最終ジャッジ日時 2024-11-16 09:04:13
合計ジャッジ時間 6,048 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 70 ms
37,604 KB
testcase_01 AC 73 ms
37,776 KB
testcase_02 AC 69 ms
37,384 KB
testcase_03 AC 68 ms
37,340 KB
testcase_04 AC 71 ms
37,680 KB
testcase_05 AC 71 ms
37,524 KB
testcase_06 AC 68 ms
37,796 KB
testcase_07 AC 72 ms
37,628 KB
testcase_08 AC 67 ms
37,772 KB
testcase_09 AC 68 ms
37,564 KB
testcase_10 AC 71 ms
37,592 KB
testcase_11 AC 71 ms
37,284 KB
testcase_12 AC 70 ms
37,676 KB
testcase_13 AC 67 ms
37,604 KB
testcase_14 AC 73 ms
37,792 KB
testcase_15 AC 71 ms
37,376 KB
testcase_16 AC 70 ms
37,816 KB
testcase_17 AC 68 ms
37,604 KB
testcase_18 AC 77 ms
37,660 KB
testcase_19 AC 74 ms
37,748 KB
testcase_20 AC 69 ms
37,660 KB
testcase_21 AC 71 ms
37,748 KB
testcase_22 AC 69 ms
37,408 KB
testcase_23 AC 69 ms
37,788 KB
testcase_24 AC 71 ms
37,556 KB
testcase_25 AC 75 ms
37,884 KB
testcase_26 AC 67 ms
37,420 KB
testcase_27 AC 71 ms
37,376 KB
testcase_28 AC 74 ms
37,624 KB
testcase_29 AC 71 ms
37,660 KB
権限があれば一括ダウンロードができます

ソースコード

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 = (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());
	}
}
0