結果
問題 | No.180 美しいWhitespace (2) |
ユーザー |
|
提出日時 | 2015-04-06 02:06:39 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 1,594 ms / 5,000 ms |
コード長 | 3,768 bytes |
コンパイル時間 | 3,945 ms |
コンパイル使用メモリ | 92,184 KB |
実行使用メモリ | 52,524 KB |
最終ジャッジ日時 | 2024-07-04 03:13:02 |
合計ジャッジ時間 | 25,108 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 31 |
ソースコード
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)); } }