#747105 (Python3) No.1998 Manhattan Restaurant

• 問題: No.1998 Manhattan Restaurant
• ユーザー: MasKoaTS
• 提出日時: 2022-03-19 16:26:01
• 言語: Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
• 結果: AC
• 実行時間: 1,784 ms / 2,000 ms
• コード長: 980 bytes
• コンパイル時間: 205 ms
• コンパイル使用メモリ: 12,928 KB
• 実行使用メモリ: 24,960 KB
• 最終ジャッジ日時: 2024-09-21 02:04:39
• 合計ジャッジ時間: 23,557 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	34 ms; 10,880 KB
testcase_01	AC	30 ms; 10,880 KB
testcase_02	AC	30 ms; 10,752 KB
testcase_03	AC	30 ms; 10,752 KB
testcase_04	AC	30 ms; 10,752 KB
testcase_05	AC	31 ms; 10,752 KB
testcase_06	AC	41 ms; 10,752 KB
testcase_07	AC	41 ms; 10,752 KB
testcase_08	AC	41 ms; 10,752 KB
testcase_09	AC	41 ms; 10,880 KB
testcase_10	AC	37 ms; 10,752 KB
testcase_11	AC	35 ms; 10,752 KB
testcase_12	AC	33 ms; 10,880 KB
testcase_13	AC	33 ms; 10,752 KB
testcase_14	AC	38 ms; 10,752 KB
testcase_15	AC	952 ms; 24,576 KB
testcase_16	AC	807 ms; 18,560 KB
testcase_17	AC	1,139 ms; 21,376 KB
testcase_18	AC	836 ms; 18,688 KB
testcase_19	AC	907 ms; 19,584 KB
testcase_20	AC	1,186 ms; 24,704 KB
testcase_21	AC	1,784 ms; 24,832 KB
testcase_22	AC	1,781 ms; 24,832 KB
testcase_23	AC	1,778 ms; 24,960 KB
testcase_24	AC	1,770 ms; 24,960 KB
testcase_25	AC	121 ms; 11,520 KB
testcase_26	AC	881 ms; 19,328 KB
testcase_27	AC	611 ms; 16,512 KB
testcase_28	AC	948 ms; 19,456 KB
testcase_29	AC	641 ms; 16,768 KB
testcase_30	AC	1,294 ms; 23,168 KB
testcase_31	AC	1,193 ms; 22,272 KB
testcase_32	AC	165 ms; 12,032 KB
testcase_33	AC	776 ms; 18,432 KB
testcase_34	AC	996 ms; 19,968 KB

ソースコード

import sys
input = sys.stdin.readline

def main():
	INF = 10 ** 18
	N = int(input())
	P = []
	for _ in [0] * N:
		x, y = map(int, input().split())
		P.append((x + y, x - y))

	max_x = max_y = -INF
	min_x = min_y = INF
	for x, y in P:
		if(max_x < x):
			max_x = x
		if(max_y < y):
			max_y = y
		if(min_x > x):
			min_x = x
		if(min_y > y):
			min_y = y

	ok = 2 * 10 ** 9 + 1
	ng = -1
	while(ok - ng > 1):
		k = ok + ng
		f = False
		block = [[0] * 2 for _ in [0] * 2]
		for x, y in P:
			if((x < max_x - k and x > min_x + k) or (y < max_y - k and y > min_y + k)):
				break
			if(x < max_x - k and y < max_y - k):
				block[0][0] = 1
			if(x > min_x + k and y < max_y - k):
				block[1][0] = 1
			if(x < max_x - k and y > min_y + k):
				block[0][1] = 1
			if(x > min_x + k and y > min_y + k):
				block[1][1] = 1
		else:
			if((block[0][0] | block[1][1]) == 0 or (block[0][1] | block[1][0]) == 0):
				f = True
		if(f):
			ok = k // 2
		else:
			ng = k // 2
	print(ok)

main()