結果
| 問題 | No.1998 Manhattan Restaurant |
| ユーザー |
 rniya
|
| 提出日時 | 2022-07-01 22:55:25 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 113 ms / 2,000 ms |
| コード長 | 6,935 bytes |
| コンパイル時間 | 2,072 ms |
| コンパイル使用メモリ | 197,628 KB |
| 最終ジャッジ日時 | 2025-01-30 03:23:01 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 31 |
ソースコード
#define LOCAL#include <bits/stdc++.h>using namespace std;#pragma region Macrostypedef long long ll;typedef __int128_t i128;typedef unsigned int uint;typedef unsigned long long ull;#define ALL(x) (x).begin(), (x).end()template <typename T> istream& operator>>(istream& is, vector<T>& v) {for (T& x : v) is >> x;return is;}template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {for (size_t i = 0; i < v.size(); i++) {os << v[i] << (i + 1 == v.size() ? "" : " ");}return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {os << '(' << p.first << ',' << p.second << ')';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {os << '{';for (auto itr = m.begin(); itr != m.end();) {os << '(' << itr->first << ',' << itr->second << ')';if (++itr != m.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {os << '{';for (auto itr = s.begin(); itr != s.end();) {os << *itr;if (++itr != s.end()) os << ',';}os << '}';return os;}template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {for (size_t i = 0; i < v.size(); i++) {os << v[i] << (i + 1 == v.size() ? "" : " ");}return os;}template <typename T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) {for (size_t i = 0; i < N; i++) {os << v[i] << (i + 1 == N ? "" : " ");}return os;}template <int i, typename T> void print_tuple(ostream&, const T&) {}template <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {if (i) os << ',';os << get<i>(t);print_tuple<i + 1, T, Args...>(os, t);}template <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {os << '{';print_tuple<0, tuple<Args...>, Args...>(os, t);return os << '}';}void debug_out() { cerr << '\n'; }template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {cerr << head;if (sizeof...(Tail) > 0) cerr << ", ";debug_out(move(tail)...);}#ifdef LOCAL#define debug(...) \cerr << " "; \cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \cerr << " "; \debug_out(__VA_ARGS__)#else#define debug(...) void(0)#endiftemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }int popcount(signed t) { return __builtin_popcount(t); }int popcount(long long t) { return __builtin_popcountll(t); }bool ispow2(int i) { return i && (i & -i) == i; }long long MSK(int n) { return (1LL << n) - 1; }template <class T> T ceil(T x, T y) {assert(y >= 1);return (x > 0 ? (x + y - 1) / y : x / y);}template <class T> T floor(T x, T y) {assert(y >= 1);return (x > 0 ? x / y : (x - y + 1) / y);}template <class T1, class T2> inline bool chmin(T1& a, T2 b) {if (a > b) {a = b;return true;}return false;}template <class T1, class T2> inline bool chmax(T1& a, T2 b) {if (a < b) {a = b;return true;}return false;}template <typename T> void mkuni(vector<T>& v) {sort(v.begin(), v.end());v.erase(unique(v.begin(), v.end()), v.end());}template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }#pragma endregionconst ll INF = 1e10;const long long IINF = 1e18;const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};const char dir[4] = {'D', 'R', 'U', 'L'};const long long MOD = 1000000007;// const long long MOD = 998244353;int main() {cin.tie(0);ios::sync_with_stdio(false);int N;cin >> N;vector<ll> X(N), Y(N);for (int i = 0; i < N; i++) {ll x, y;cin >> x >> y;X[i] = x + y;Y[i] = x - y;}int target = 0;for (int i = 1; i < N; i++) {if (X[i] < X[target]) {target = i;}}auto check = [&](ll d) -> bool {ll XL = -INF, XR = INF, YL = -INF, YR = INF;bool found = false;for (int i = 0; i < N; i++) {if (i == target) continue;ll xl = max(X[i] - d, X[target] - d), xr = min(X[i] + d, X[target] + d);ll yl = max(Y[i] - d, Y[target] - d), yr = min(Y[i] + d, Y[target] + d);if (xr < xl or yr < yl) {found = true;chmax(XL, X[i] - d);chmin(XR, X[i] + d);chmax(YL, Y[i] - d);chmin(YR, Y[i] + d);}}if (!found) return true;if (XR < XL or YR < YL) return false;for (ll x : {XL, XR}) {for (ll y : {YL, YR}) {ll nXL = -INF, nXR = INF, nYL = -INF, nYR = INF;for (int i = 0; i < N; i++) {if (X[i] - d <= x and x <= X[i] + d and Y[i] - d <= y and y <= Y[i] + d) continue;chmax(nXL, X[i] - d);chmin(nXR, X[i] + d);chmax(nYL, Y[i] - d);chmin(nYR, Y[i] + d);}if (nXL <= nXR and nYL <= nYR) return true;}}return false;};ll lb = -1, ub = 4LL * INF;while (ub - lb > 1) {ll mid = (ub + lb) >> 1;(check(mid) ? ub : lb) = mid;}cout << ub << '\n';return 0;}