結果
問題 |
No.1998 Manhattan Restaurant
|
ユーザー |
![]() |
提出日時 | 2022-07-01 23:44:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 282 ms / 2,000 ms |
コード長 | 1,660 bytes |
コンパイル時間 | 238 ms |
コンパイル使用メモリ | 82,120 KB |
実行使用メモリ | 82,828 KB |
最終ジャッジ日時 | 2024-11-26 07:50:08 |
合計ジャッジ時間 | 6,706 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 31 |
ソースコード
import sys # sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = (1 << 63)-1 inf = (1 << 31)-1 md = 10**9+7 # md = 998244353 from bisect import * n = II() # ii,jj=set(),set() il = jl = inf ir = jr = -inf ij = [] for _ in range(n): x, y = LI() i = x+y j = x-y ij.append((i, j)) il = min(il, i) ir = max(ir, i) jl = min(jl, j) jr = max(jr, j) def binary_search(l, r, ok, minimize): if minimize: l -= 1 else: r += 1 while l+1 < r: m = (l+r)//2 if ok(m) ^ minimize: l = m else: r = m if minimize: return r return l def ok(m): i1, j1 = il+m, jl+m i2, j2 = ir-m, jr-m # print(m, i1, j1, i2, j2) ng1 = ng2 = False for i, j in ij: d = min(max(abs(i-i1), abs(j-j1)), max(abs(i-i2), abs(j-j2))) if d > m: ng1 = True d = min(max(abs(i-i1), abs(j-j2)), max(abs(i-i2), abs(j-j1))) if d > m: ng2 = True if ng1 & ng2: return False return True r = max((ir-il)//2, (jr-jl)//2) # pDB(r) ans = binary_search(0, r, ok, True) print(ans)