結果

問題 No.198 キャンディー・ボックス２
ユーザー yuya178yuya178
提出日時 2017-11-10 01:59:44
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,435 bytes
コンパイル時間 2,120 ms
コンパイル使用メモリ 84,236 KB
実行使用メモリ 50,420 KB
最終ジャッジ日時 2024-11-24 08:23:26
合計ジャッジ時間 4,466 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 AC 48 ms
36,912 KB
testcase_10 AC 48 ms
37,060 KB
testcase_11 AC 48 ms
36,960 KB
testcase_12 AC 50 ms
36,840 KB
testcase_13 WA -
testcase_14 AC 48 ms
36,904 KB
testcase_15 AC 50 ms
36,968 KB
testcase_16 AC 49 ms
37,032 KB
testcase_17 AC 50 ms
36,784 KB
testcase_18 AC 50 ms
36,540 KB
testcase_19 AC 49 ms
36,732 KB
testcase_20 AC 50 ms
36,668 KB
testcase_21 AC 50 ms
36,956 KB
testcase_22 AC 49 ms
37,000 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.Point;

public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";

    long MOD = 1_000_000_007;
    int inf = 10000000;

    void solve()
    {
        int B = ni();
        int n = ni();
        int[] c = new int[n];
        long sum = B;
        for(int i = 0; i < n; i++){
            c[i] = ni();
            sum += c[i];
        }
        long h = sum/n;
        long left = 0;
        long right = h;
        while(left+2<right){
            long lm = (left+left+right)/3;
            long rm = (left+right+right)/3;
            if(f(lm,c,n)>=f(rm,c,n)) left = lm;
            else if(f(lm,c,n)<f(rm,c,n)) right = rm;
        }
        long ans = inf;
        for(int i = (int)left; i <= (int)right; i++){
            ans = Math.min(f(i,c,n),ans);
        }
        out.println(ans);   
    }

    long f(long a, int[] c, int n){
        long res = 0;
        for(int i = 0; i < n; i++){
            res+=Math.abs(c[i]-a);
        }
        return res;
    }
    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }

    static class ArrayUtils {
        public static void fill(double[][] array, double value) {
            for (double[] a : array) Arrays.fill(a, value);
        }
 
        public static void fill(double[][][] array, double value) {
            for (double[][] l : array) fill(l, value);
        } 
    }
}
0