結果

問題 No.180 美しいWhitespace (2)
ユーザー yuya178yuya178
提出日時 2017-11-08 05:33:38
言語 Java21
(openjdk 21)
結果
AC  
実行時間 58 ms / 5,000 ms
コード長 4,427 bytes
コンパイル時間 2,377 ms
コンパイル使用メモリ 83,044 KB
実行使用メモリ 37,168 KB
最終ジャッジ日時 2024-11-24 05:11:44
合計ジャッジ時間 5,442 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
36,736 KB
testcase_01 AC 48 ms
37,080 KB
testcase_02 AC 48 ms
36,852 KB
testcase_03 AC 49 ms
36,988 KB
testcase_04 AC 49 ms
36,752 KB
testcase_05 AC 51 ms
36,744 KB
testcase_06 AC 48 ms
36,556 KB
testcase_07 AC 51 ms
36,928 KB
testcase_08 AC 51 ms
37,084 KB
testcase_09 AC 53 ms
36,800 KB
testcase_10 AC 54 ms
36,924 KB
testcase_11 AC 56 ms
36,988 KB
testcase_12 AC 54 ms
37,064 KB
testcase_13 AC 56 ms
37,132 KB
testcase_14 AC 58 ms
36,768 KB
testcase_15 AC 56 ms
36,904 KB
testcase_16 AC 55 ms
37,168 KB
testcase_17 AC 56 ms
37,000 KB
testcase_18 AC 56 ms
36,948 KB
testcase_19 AC 55 ms
36,912 KB
testcase_20 AC 48 ms
36,956 KB
testcase_21 AC 49 ms
36,588 KB
testcase_22 AC 48 ms
37,084 KB
testcase_23 AC 48 ms
36,756 KB
testcase_24 AC 47 ms
37,128 KB
testcase_25 AC 48 ms
36,844 KB
testcase_26 AC 47 ms
36,772 KB
testcase_27 AC 49 ms
37,128 KB
testcase_28 AC 49 ms
36,976 KB
testcase_29 AC 51 ms
36,772 KB
testcase_30 AC 55 ms
37,128 KB
testcase_31 AC 56 ms
36,548 KB
testcase_32 AC 55 ms
36,972 KB
testcase_33 AC 55 ms
36,972 KB
testcase_34 AC 55 ms
36,936 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

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

    int MOD = 1000000007;
    long inf = Long.MAX_VALUE;

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

    public static long f(long x,int n,int[] a,int[] b) {
        if (x <= 0) {
            return Long.MAX_VALUE;
        }
        long max = Long.MIN_VALUE;
        long min = Long.MAX_VALUE;
        for(int i=0;i<n;i++) {
            long h = a[i] + b[i] * x;
            max = Math.max(h, max);
            min = Math.min(h, min);
        }
        return max - min;
    }   
    
    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