結果
| 問題 |
No.180 美しいWhitespace (2)
|
| コンテスト | |
| ユーザー |
yuya178
|
| 提出日時 | 2017-11-08 05:33:38 |
| 言語 | Java (openjdk 23) |
| 結果 |
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 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 31 |
ソースコード
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);
}
}
}
yuya178