結果

問題 No.180 美しいWhitespace (2)
ユーザー uwiuwi
提出日時 2015-04-06 02:06:39
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,704 ms / 5,000 ms
コード長 3,768 bytes
コンパイル時間 3,719 ms
コンパイル使用メモリ 80,204 KB
実行使用メモリ 52,384 KB
最終ジャッジ日時 2023-09-17 05:59:14
合計ジャッジ時間 26,351 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,168 KB
testcase_01 AC 42 ms
49,136 KB
testcase_02 AC 42 ms
49,272 KB
testcase_03 AC 43 ms
49,208 KB
testcase_04 AC 69 ms
50,772 KB
testcase_05 AC 84 ms
50,640 KB
testcase_06 AC 121 ms
50,576 KB
testcase_07 AC 170 ms
50,756 KB
testcase_08 AC 294 ms
52,300 KB
testcase_09 AC 723 ms
51,788 KB
testcase_10 AC 828 ms
51,744 KB
testcase_11 AC 1,564 ms
52,240 KB
testcase_12 AC 1,704 ms
52,384 KB
testcase_13 AC 1,411 ms
51,880 KB
testcase_14 AC 1,570 ms
52,092 KB
testcase_15 AC 1,642 ms
52,048 KB
testcase_16 AC 1,413 ms
51,824 KB
testcase_17 AC 1,385 ms
49,784 KB
testcase_18 AC 1,311 ms
51,800 KB
testcase_19 AC 1,073 ms
51,852 KB
testcase_20 AC 42 ms
49,096 KB
testcase_21 AC 44 ms
49,488 KB
testcase_22 AC 42 ms
49,224 KB
testcase_23 AC 43 ms
48,976 KB
testcase_24 AC 42 ms
47,040 KB
testcase_25 AC 41 ms
49,228 KB
testcase_26 AC 43 ms
49,152 KB
testcase_27 AC 42 ms
49,148 KB
testcase_28 AC 43 ms
49,108 KB
testcase_29 AC 43 ms
49,112 KB
testcase_30 AC 1,618 ms
52,004 KB
testcase_31 AC 1,618 ms
51,912 KB
testcase_32 AC 55 ms
47,688 KB
testcase_33 AC 875 ms
51,876 KB
testcase_34 AC 899 ms
52,192 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q4xx;

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 Q425 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		long[][] co = new long[n][];
		for(int i = 0;i < n;i++){
			co[i] = new long[]{ni(), ni()};
		}
		
		long min = f(1, co);
		long argmin = 1;
		for(int i = 0;i < n;i++){
			for(int j = i+1;j < n;j++){
				// a+bx=c+dx
				// (b-d)x=c-a
				if(co[i][1]-co[j][1] != 0){
					long num = -(co[i][0] - co[j][0]);
					long den = co[i][1]-co[j][1];
					if(den < 0){
						den = -den;
						num = -num;
					}
					if(num > 0){
						long x = num/den;
						if(x > 0){
							long v = f(x, co);
							if(v < min || v == min && x < argmin){
								min = v;
								argmin = x;
							}
						}
						{
							long v = f(x+1, co);
							if(v < min || v == min && x+1 < argmin){
								min = v;
								argmin = x+1;
							}
						}
					}
				}
			}
		}
		out.println(argmin);
	}
	
	long f(long x, long[][] co)
	{
		long max = 0;
		long min = Long.MAX_VALUE;
		for(long[] e : co){
			max = Math.max(max, e[0]+e[1]*x);
			min = Math.min(min, e[0]+e[1]*x);
		}
		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 Q425().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