結果

問題 No.1998 Manhattan Restaurant
ユーザー colognecologne
提出日時 2022-03-22 18:26:32
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 8 ms / 2,000 ms
コード長 3,108 bytes
コンパイル時間 1,434 ms
コンパイル使用メモリ 96,860 KB
実行使用メモリ 6,144 KB
最終ジャッジ日時 2024-09-21 02:04:53
合計ジャッジ時間 2,643 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 1 ms
5,376 KB
testcase_11 AC 1 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 1 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 7 ms
5,632 KB
testcase_16 AC 6 ms
5,376 KB
testcase_17 AC 7 ms
5,376 KB
testcase_18 AC 5 ms
5,376 KB
testcase_19 AC 6 ms
5,376 KB
testcase_20 AC 8 ms
5,632 KB
testcase_21 AC 8 ms
6,016 KB
testcase_22 AC 8 ms
6,144 KB
testcase_23 AC 8 ms
6,016 KB
testcase_24 AC 8 ms
6,016 KB
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 6 ms
5,376 KB
testcase_27 AC 5 ms
5,376 KB
testcase_28 AC 7 ms
5,376 KB
testcase_29 AC 5 ms
5,376 KB
testcase_30 AC 7 ms
5,376 KB
testcase_31 AC 7 ms
5,376 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 5 ms
5,376 KB
testcase_34 AC 6 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2,bmi2,popcnt,lzcnt")

#include <cassert>
#include <cstdio>
#include <cinttypes>
#include <unistd.h>
#include <sys/stat.h>
#include <sys/mman.h>
class strictInput
{
	char *p;
	off_t cur = 0;
	off_t len = 0;

public:
	explicit strictInput(int fd = 0)
	{
		struct stat st;
		fstat(fd, &st);
		p = (char *)mmap(NULL, st.st_size, PROT_READ, MAP_SHARED, fd, 0);
		len = st.st_size;
	}

	char readChar()
	{
		assert(cur != len);
		return p[cur++];
	}

	void unreadChar()
	{
		assert(cur != 0);
		--cur;
	}

	bool isEOF() { return cur == len; }
	void readEOF() { assert(isEOF()); }
	void readSpace() { assert(readChar() == ' '); }
	void readEoln() { assert(readChar() == '\n'); }

	// reads uint64_t in range [from, to]
	uint64_t readU64(uint64_t from = 0, uint64_t to = UINT64_MAX)
	{
		uint64_t cur = 0;
		off_t read_cnt = 0;
		bool leading_zero = false;
		while (!isEOF())
		{
			char p = readChar();
			if (!('0' <= p && p <= '9'))
			{
				unreadChar();
				break;
			}
			uint64_t v = p - '0';
			assert(cur <= UINT64_MAX / 10);
			cur *= 10;
			assert(cur <= UINT64_MAX - v);
			cur += v;
			if (read_cnt == 0 && v == 0)
				leading_zero = true;
			++read_cnt;
		}
		if (cur == 0)
			assert(read_cnt == 1);
		else
			assert(!leading_zero);
		assert(from <= cur && cur <= to);
		return cur;
	}

	// reads int64_t in range [from, to]
	int64_t readI64(int64_t from = INT64_MIN, int64_t to = INT64_MAX)
	{
		uint64_t cur = 0;
		off_t read_cnt = 0;
		bool leading_zero = false;
		bool leading_minus = readChar() == '-';
		if (!leading_minus)
			unreadChar();
		while (!isEOF())
		{
			char p = readChar();
			if (!('0' <= p && p <= '9'))
			{
				unreadChar();
				break;
			}
			uint64_t v = p - '0';
			assert(cur <= UINT64_MAX / 10);
			cur *= 10;
			assert(cur <= UINT64_MAX - v);
			cur += v;
			if (read_cnt == 0 && v == 0)
				leading_zero = true;
			++read_cnt;
		}
		if (cur == 0)
			assert(read_cnt == 1 && !leading_minus);
		else
			assert(!leading_zero);

		if (cur <= INT64_MAX)
		{
			int64_t ret = cur;
			if (leading_minus)
				ret = -ret;
			assert(from <= ret && ret <= to);
			return ret;
		}
		else
		{
			assert(leading_minus && cur == uint64_t(INT64_MIN));
			assert(from == INT64_MIN);
			return INT64_MIN;
		}
	}
};

#include <climits>
#include <iostream>
#include <vector>

using namespace std;
int main()
{
	strictInput Inp;
	int N = Inp.readI64(1, 100'000);
	Inp.readEoln();
	vector<pair<int, int>> V(N);

	int mina = INT_MAX, maxa = INT_MIN, minb = INT_MAX, maxb = INT_MIN;
	for (auto &[a, b] : V)
	{
		int x, y;
		x = Inp.readI64(-1'000'000'000, 1'000'000'000);
		Inp.readSpace();
		y = Inp.readI64(-1'000'000'000, 1'000'000'000);
		Inp.readEoln();
		a = (x + y) / 2, b = (x - y) / 2;
		mina = min(mina, a), maxa = max(maxa, a);
		minb = min(minb, b), maxb = max(maxb, b);
	}
	Inp.readEOF();
	int ans1 = 0, ans2 = 0;
	for (auto [a, b] : V)
	{
		ans1 = max(ans1, min(max(a - mina, b - minb), max(maxa - a, maxb - b)));
		ans2 = max(ans2, min(max(a - mina, maxb - b), max(maxa - a, b - minb)));
	}
	cout << min(ans1, ans2) << endl;
}
0