結果

問題 No.180 美しいWhitespace (2)
ユーザー uwiuwi
提出日時 2015-04-06 19:09:48
言語 Java21
(openjdk 21)
結果
AC  
実行時間 45 ms / 5,000 ms
コード長 3,909 bytes
コンパイル時間 5,152 ms
コンパイル使用メモリ 77,676 KB
実行使用メモリ 33,780 KB
最終ジャッジ日時 2023-09-17 06:18:02
合計ジャッジ時間 6,765 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 38 ms
33,252 KB
testcase_01 AC 38 ms
33,192 KB
testcase_02 AC 37 ms
33,160 KB
testcase_03 AC 38 ms
33,476 KB
testcase_04 AC 38 ms
33,764 KB
testcase_05 AC 39 ms
33,636 KB
testcase_06 AC 39 ms
33,192 KB
testcase_07 AC 40 ms
33,232 KB
testcase_08 AC 41 ms
33,588 KB
testcase_09 AC 43 ms
33,304 KB
testcase_10 AC 42 ms
33,504 KB
testcase_11 AC 43 ms
33,352 KB
testcase_12 AC 43 ms
33,240 KB
testcase_13 AC 45 ms
33,636 KB
testcase_14 AC 43 ms
33,284 KB
testcase_15 AC 42 ms
33,776 KB
testcase_16 AC 44 ms
33,768 KB
testcase_17 AC 43 ms
33,780 KB
testcase_18 AC 42 ms
33,360 KB
testcase_19 AC 43 ms
33,200 KB
testcase_20 AC 39 ms
33,388 KB
testcase_21 AC 38 ms
33,268 KB
testcase_22 AC 38 ms
33,268 KB
testcase_23 AC 38 ms
33,312 KB
testcase_24 AC 38 ms
33,256 KB
testcase_25 AC 38 ms
33,300 KB
testcase_26 AC 38 ms
33,572 KB
testcase_27 AC 38 ms
33,336 KB
testcase_28 AC 39 ms
33,276 KB
testcase_29 AC 38 ms
33,192 KB
testcase_30 AC 44 ms
33,292 KB
testcase_31 AC 43 ms
33,316 KB
testcase_32 AC 44 ms
33,320 KB
testcase_33 AC 42 ms
33,608 KB
testcase_34 AC 44 ms
33,596 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q425R {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[][] co = new int[n][];
		for(int i = 0;i < n;i++){
			co[i] = na(2);
		}
		long x = goldenSectionMethod(1, 10000000000L, co);
		long v = f(x, co);
		if(v > f(x+1, co)){
			x++;
			v = f(x+1, co);
		}
		out.println(x);
	}
	
	public static long goldenSectionMethod(long low, long high, int[][] co)
	{
		final double tau = (Math.sqrt(5)-1)/2;
		long nl = Math.round(high + tau * (low - high));
		long nh = Math.round(low + tau * (high - low));
		long vl = f(nl, co);
		long vh = f(nh, co);
		while(high - low > 2){
//			tr(low, nl, nh, high);
//			tr(f(low, co), f(nl, co), f(nh, co), f(high, co));
//			tr();
			if(vl <= vh){
				high = nh;
				vh = vl;
				nh = nl;
				nl = Math.round(high + tau * (low - high));
				if(nl == nh)nl--;
				vl = f(nl, co);
			}else{
				low = nl;
				vl = vh;
				nl = nh;
				nh = Math.round(low + tau * (high - low));
				if(nh == nl)nh++;
				vh = f(nh, co);
			}
		}
		return low;
	}
	
	public static long f(long x, int[][] co)
	{
		long max = 0, min = Long.MAX_VALUE;
		for(int[] c : co){
			long v = c[0] + c[1] * x;
			if(v > max)max = v;
			if(v < min)min = v;
		}
		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 Q425R().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))){ // when nextLine, (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