結果
問題 | No.1998 Manhattan Restaurant |
ユーザー |
👑 |
提出日時 | 2022-07-02 00:30:10 |
言語 | D (dmd 2.109.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,220 bytes |
コンパイル時間 | 1,016 ms |
コンパイル使用メモリ | 122,996 KB |
実行使用メモリ | 14,008 KB |
最終ジャッジ日時 | 2024-06-22 15:39:43 |
合計ジャッジ時間 | 3,345 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 WA * 1 |
other | AC * 1 WA * 30 |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken.to!int; }long readLong() { return readToken.to!long; }real readReal() { return readToken.to!real; }bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1;(unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }enum INF = 10L^^10;void main() {try {for (; ; ) {const N = readInt;auto X = new long[N];auto Y = new long[N];foreach (i; 0 .. N) {X[i] = readLong;Y[i] = readLong;}auto as = new long[N];auto bs = new long[N];foreach (i; 0 .. N) {as[i] = X[i] + Y[i];bs[i] = X[i] - Y[i];}long solve(long a0, long b0, long a1, long b1) {long ret;foreach (i; 0 .. N) {long mn = INF;chmin(mn, abs(as[i] - a0) + abs(bs[i] - b0));chmin(mn, abs(as[i] - a1) + abs(bs[i] - b1));chmax(ret, mn);}return ret;}const minA = as.minElement;const maxA = as.maxElement;const minB = bs.minElement;const maxB = bs.maxElement;long ans = INF;chmin(ans, solve(minA, minB, maxA, maxB));chmin(ans, solve(minA, maxB, maxA, minB));ans = (ans + 1) / 2;writeln(ans);}} catch (EOFException e) {}}