結果

問題 No.609 Noelちゃんと星々
ユーザー yuya178yuya178
提出日時 2017-12-09 00:41:42
言語 Java21
(openjdk 21)
結果
AC  
実行時間 122 ms / 2,000 ms
コード長 3,866 bytes
コンパイル時間 2,864 ms
コンパイル使用メモリ 87,268 KB
実行使用メモリ 51,928 KB
最終ジャッジ日時 2024-05-07 06:24:12
合計ジャッジ時間 6,787 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 113 ms
51,564 KB
testcase_01 AC 96 ms
51,448 KB
testcase_02 AC 94 ms
51,080 KB
testcase_03 AC 100 ms
51,304 KB
testcase_04 AC 94 ms
51,248 KB
testcase_05 AC 117 ms
51,820 KB
testcase_06 AC 115 ms
51,668 KB
testcase_07 AC 99 ms
51,584 KB
testcase_08 AC 81 ms
51,052 KB
testcase_09 AC 93 ms
51,156 KB
testcase_10 AC 115 ms
51,724 KB
testcase_11 AC 106 ms
51,576 KB
testcase_12 AC 113 ms
51,644 KB
testcase_13 AC 99 ms
51,392 KB
testcase_14 AC 84 ms
50,896 KB
testcase_15 AC 117 ms
51,852 KB
testcase_16 AC 117 ms
51,692 KB
testcase_17 AC 119 ms
51,788 KB
testcase_18 AC 97 ms
51,344 KB
testcase_19 AC 116 ms
51,776 KB
testcase_20 AC 122 ms
51,788 KB
testcase_21 AC 119 ms
51,684 KB
testcase_22 AC 119 ms
51,720 KB
testcase_23 AC 120 ms
51,804 KB
testcase_24 AC 119 ms
51,928 KB
権限があれば一括ダウンロードができます

ソースコード

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 = Integer.MAX_VALUE;

    void solve(){
        int n = ni();
        long[] y = new long[n];
        for(int i = 0; i < n ;i++){
            y[i] = nl();
        }
        long left = -inf;
        long right = inf;
        while(left+1<right){
            long res = (left+right)/2;
            if(f(res,y,n)>f(res+1,y,n)) left = res;
            else right = res;
        }
        out.println(f(right,y,n));
    }

    long f(long res, long[] y, int n){
        long ans = 0;
        for(int i = 0; i < n; i++){
            ans += Math.abs(res-y[i]);
        }
        return ans;
    }
    
    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)); }
 
}
0