結果

問題 No.198 キャンディー・ボックス２
ユーザー uafr_cs
提出日時 2015-09-03 00:07:53
言語 Java
(openjdk 23)
結果
AC  
実行時間 136 ms / 1,000 ms
コード長 2,906 bytes
コンパイル時間 2,684 ms
コンパイル使用メモリ 83,480 KB
実行使用メモリ 41,664 KB
最終ジャッジ日時 2024-11-16 09:07:39
合計ジャッジ時間 7,596 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Random;
import java.util.Scanner;
import java.util.Set;

public class Main {
	
	public static long solve_smart(long B, int N, long[] arr){
		long score = Long.MAX_VALUE;
		for(int pos = 0; pos < N; pos++){
			long benefit = B, current_score = 0;
			
			for(int i = 0; i < N; i++){
				benefit += (arr[i] - arr[pos]);
				current_score += Math.abs(arr[i] - arr[pos]);
			}
			if(benefit < 0){ continue; }
			
			score = Math.min(score, current_score);
		}
		
		{
			final long max = (Arrays.stream(arr).sum() + B) / N;
			System.out.println(max);
			long current_score = 0;
			for(int i = 0; i < N; i++){
				current_score += Math.abs(arr[i] - max);
			}
			
			score = Math.min(score , current_score);
		}
		
		return score;
	}
	
	public static long solve_naive(long B, int N, long[] arr){
		//System.out.println(Arrays.toString(arr));
		final long max = Arrays.stream(arr).max().getAsLong();
		
		long score = Long.MAX_VALUE, min_cur = -1;
		for(long cur = 0; cur <= max; cur++){
			long benefit = B, current_score = 0;
			
			for(int i = 0; i < N; i++){
				benefit += (arr[i] - cur);
				current_score += Math.abs(arr[i] - cur);
			}
			if(benefit < 0){ continue; }
			
			if(score > current_score){
				score = current_score;
				min_cur = cur;
			}
			score = Math.min(score, current_score);
		}
		
		System.out.println(B + " " + N + " " + Arrays.toString(arr) + " " + min_cur + " " + Arrays.stream(arr).average() + " "  + score);
		
		return score;
	}
	
	public static void check(){
		Random rnd = new Random();
		
		while(true){
			final long B = rnd.nextInt(1000);
			final int N = rnd.nextInt(9) + 1;
			long[] arr = new long[N];
			for(int i = 0; i < N; i++){
				arr[i] = rnd.nextInt(100);
			}
			
			final long smart = solve_smart(B, N, arr);
			final long naive = solve_naive(B, N, arr);
			
			if(smart != naive){
				System.out.println(">>>> naive = " + naive + ", smart = " + smart);
				//
			}
			
		}
	}
	
	public static void main(String[] args) {
		//check();
		
		Scanner sc = new Scanner(System.in);

		final long B = sc.nextLong();
		final int N = sc.nextInt();
		
		long[] arr = new long[N];
		for(int i = 0; i < N; i++){
			final long c = sc.nextLong();
		
			arr[i] = c;
		}
		
		Arrays.sort(arr);
		
		long score = Long.MAX_VALUE;
		for(int pos = 0; pos < N; pos++){
			long benefit = B, current_score = 0;
			
			for(int i = 0; i < N; i++){
				benefit += (arr[i] - arr[pos]);
				current_score += Math.abs(arr[i] - arr[pos]);
			}
			if(benefit < 0){ continue; }
			
			score = Math.min(score, current_score);
		}
		
		{
			final long max = (Arrays.stream(arr).sum() + B) / N;
			
			long current_score = 0;
			for(int i = 0; i < N; i++){
				current_score += Math.abs(arr[i] - max);
			}
			
			score = Math.min(score , current_score);
		}
		
		System.out.println(score);

	}

}
0