結果
問題 |
No.2436 Min Diff Distance
|
ユーザー |
|
提出日時 | 2023-08-18 22:55:23 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 358 ms / 2,000 ms |
コード長 | 5,682 bytes |
コンパイル時間 | 2,698 ms |
コンパイル使用メモリ | 213,276 KB |
最終ジャッジ日時 | 2025-02-16 10:35:02 |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 23 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (n); i++) #define per(i, n) for (int i = (n)-1; i >= 0; i--) #define rep2(i, l, r) for (int i = (l); i < (r); i++) #define per2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define each(e, v) for (auto &e : v) #define MM << " " << #define pb push_back #define eb emplace_back #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define sz(x) (int)x.size() using ll = long long; using pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>; template <typename T> using minheap = priority_queue<T, vector<T>, greater<T>>; template <typename T> using maxheap = priority_queue<T>; template <typename T> bool chmax(T &x, const T &y) { return (x < y) ? (x = y, true) : false; } template <typename T> bool chmin(T &x, const T &y) { return (x > y) ? (x = y, true) : false; } template <typename T> int flg(T x, int i) { return (x >> i) & 1; } int pct(int x) { return __builtin_popcount(x); } int pct(ll x) { return __builtin_popcountll(x); } int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); } int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); } int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); } int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); } template <typename T> void print(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' '); if (v.empty()) cout << '\n'; } template <typename T> void printn(const vector<T> &v, T x = 0) { int n = v.size(); for (int i = 0; i < n; i++) cout << v[i] + x << '\n'; } template <typename T> int lb(const vector<T> &v, T x) { return lower_bound(begin(v), end(v), x) - begin(v); } template <typename T> int ub(const vector<T> &v, T x) { return upper_bound(begin(v), end(v), x) - begin(v); } template <typename T> void rearrange(vector<T> &v) { sort(begin(v), end(v)); v.erase(unique(begin(v), end(v)), end(v)); } template <typename T> vector<int> id_sort(const vector<T> &v, bool greater = false) { int n = v.size(); vector<int> ret(n); iota(begin(ret), end(ret), 0); sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; }); return ret; } template <typename T> void reorder(vector<T> &a, const vector<int> &ord) { int n = a.size(); vector<T> b(n); for (int i = 0; i < n; i++) b[i] = a[ord[i]]; swap(a, b); } template <typename T> T floor(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? x / y : (x - y + 1) / y); } template <typename T> T ceil(T x, T y) { assert(y != 0); if (y < 0) x = -x, y = -y; return (x >= 0 ? (x + y - 1) / y : x / y); } template <typename S, typename T> pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first + q.first, p.second + q.second); } template <typename S, typename T> pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) { return make_pair(p.first - q.first, p.second - q.second); } template <typename S, typename T> istream &operator>>(istream &is, pair<S, T> &p) { S a; T b; is >> a >> b; p = make_pair(a, b); return is; } template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) { return os << p.first << ' ' << p.second; } struct io_setup { io_setup() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); cerr << fixed << setprecision(15); } } io_setup; constexpr int inf = (1 << 30) - 1; constexpr ll INF = (1LL << 60) - 1; // constexpr int MOD = 1000000007; constexpr int MOD = 998244353; template <typename T> vector<T> manhattan_min(vector<T> xs, vector<T> ys) { assert(xs.size() == ys.size()); int n = xs.size(); vector<int> ord(n); iota(begin(ord), end(ord), 0); vector<pair<int, int>> es; for (int s = 0; s < 2; s++) { auto comp = [&](int i, int j) { return xs[i] + ys[i] < xs[j] + ys[j]; }; sort(begin(ord), end(ord), comp); for (int t = 0; t < 2; t++) { map<T, int> mp; for (auto &i : ord) { for (auto it = mp.lower_bound(-ys[i]); it != end(mp); it = mp.erase(it)) { int j = it->second; if (xs[i] - ys[i] < xs[j] - ys[j]) break; es.emplace_back(i, j); } mp[-ys[i]] = i; } if (t == 0) swap(xs, ys); } for (auto &e : xs) e = -e; } auto dist = [&](int i, int j) { return abs(xs[i] - xs[j]) + abs(ys[i] - ys[j]); }; vector<T> ret(n, -1); for (auto [x, y] : es) { if (ret[x] == -1 || ret[x] > dist(x, y)) ret[x] = dist(x, y); if (ret[y] == -1 || ret[y] > dist(x, y)) ret[y] = dist(x, y); } return ret; } void solve() { int N; cin >> N; vector<int> xs(N), ys(N); int mi1 = inf, ma1 = -inf, mi2 = inf, ma2 = -inf; rep(i, N) { cin >> xs[i] >> ys[i]; int z1 = xs[i] + ys[i], z2 = xs[i] - ys[i]; chmin(mi1, z1), chmax(ma1, z1); chmin(mi2, z2), chmax(ma2, z2); } vector<int> ma(N, -1); rep(i, N) { int z1 = xs[i] + ys[i], z2 = xs[i] - ys[i]; chmax(ma[i], max(ma1 - z1, z1 - mi1)); chmax(ma[i], max(ma2 - z2, z2 - mi2)); } auto mi = manhattan_min(xs, ys); int ans = inf; rep(i, N) chmin(ans, ma[i] - mi[i]); cout << ans << '\n'; } int main() { int T = 1; // cin >> T; while (T--) solve(); }