結果

問題 No.2436 Min Diff Distance
ユーザー ebi_flyebi_fly
提出日時 2023-08-15 02:59:26
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 326 ms / 2,000 ms
コード長 6,808 bytes
コンパイル時間 2,146 ms
コンパイル使用メモリ 155,640 KB
実行使用メモリ 21,336 KB
最終ジャッジ日時 2024-11-23 06:04:50
合計ジャッジ時間 8,015 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 1 "template/template.hpp"
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstddef>
#include <cstdint>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n)-1); i >= (int)(a); i--)
#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)
#define RRep(i, a, n) for (i64 i = ((i64)(n)-i64(1)); i >= (i64)(a); i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

#line 2 "template/debug_template.hpp"

#line 4 "template/debug_template.hpp"

namespace ebi {

#ifdef LOCAL
#define debug(...)                                                      \
    std::cerr << "LINE: " << __LINE__ << "  [" << #__VA_ARGS__ << "]:", \
        debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() {
    std::cerr << std::endl;
}

template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
    std::cerr << " " << h;
    if (sizeof...(t) > 0) std::cerr << " :";
    debug_out(t...);
}

}
#line 2 "template/int_alias.hpp"

#line 4 "template/int_alias.hpp"

namespace ebi {

using std::size_t;
using i8 = std::int8_t;
using u8 = std::uint8_t;
using i16 = std::int16_t;
using u16 = std::uint16_t;
using i32 = std::int32_t;
using u32 = std::uint32_t;
using i64 = std::int64_t;
using u64 = std::uint64_t;
using i128 = __int128_t;
using u128 = __uint128_t;

}
#line 2 "template/io.hpp"

#line 6 "template/io.hpp"

namespace ebi {

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {
    return os << pa.first << " " << pa.second;
}

template <typename T1, typename T2>
std::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {
    return os >> pa.first >> pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {
    for (std::size_t i = 0; i < vec.size(); i++)
        os << vec[i] << (i + 1 == vec.size() ? "" : " ");
    return os;
}

template <typename T>
std::istream &operator>>(std::istream &os, std::vector<T> &vec) {
    for (T &e : vec) std::cin >> e;
    return os;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {
    if (opt) {
        os << opt.value();
    } else {
        os << "invalid value";
    }
    return os;
}

void fast_io() {
    std::cout << std::fixed << std::setprecision(15);
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
}

}  // namespace ebi
#line 2 "template/utility.hpp"

#line 5 "template/utility.hpp"

#line 7 "template/utility.hpp"

namespace ebi {

template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

constexpr i64 LNF = std::numeric_limits<i64>::max() / 4;

constexpr int INF = std::numeric_limits<int>::max() / 2;

const std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};
const std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};

}  // namespace ebi
#line 2 "graph/template.hpp"

#line 4 "graph/template.hpp"

namespace ebi {

template <class T> struct Edge {
    int to;
    T cost;
    Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}
};

template <class T> struct Graph : std::vector<std::vector<Edge<T>>> {
    using std::vector<std::vector<Edge<T>>>::vector;
    void add_edge(int u, int v, T w, bool directed = false) {
        (*this)[u].emplace_back(v, w);
        if (directed) return;
        (*this)[v].emplace_back(u, w);
    }
};

struct graph : std::vector<std::vector<int>> {
    using std::vector<std::vector<int>>::vector;
    void add_edge(int u, int v, bool directed = false) {
        (*this)[u].emplace_back(v);
        if (directed) return;
        (*this)[v].emplace_back(u);
    }
};

}  // namespace ebi
#line 3 "a.cpp"

#include <atcoder/segtree>

namespace ebi {

int op(int a, int b) {
    return a < b ? a : b;
}

int e() {
    return INF;
}

void main_() {
    int n;
    std::cin >> n;
    std::vector<std::pair<int,int>> xy(n);
    std::vector table(n, std::vector<int>());
    rep(i,0,n) {
        auto &[x, y] = xy[i];
        std::cin >> x >> y;
        x--; y--;
        table[x].emplace_back(i);
    }
    std::vector<int> p(n, INF);
    {
        atcoder::segtree<int, op, e> seg_upper(n), seg_lower(n);
        rep(x,0,n) {
            for(auto idx: table[x]) {
                int y = xy[idx].second;
                chmin(p[idx], seg_upper.get(y) + x - y);

                seg_upper.set(y, op(seg_upper.get(y), y-x));
                seg_lower.set(y, op(seg_lower.get(y), -y-x));
            }
            for(auto idx: table[x]) {
                int y = xy[idx].second;
                chmin(p[idx], seg_upper.prod(y+1, n) + x - y);
                chmin(p[idx], seg_lower.prod(0, y) + x + y);
            }
        }
    }
    {
        atcoder::segtree<int, op, e> seg_upper(n), seg_lower(n);
        rrep(x,0,n) {
            for(auto idx: table[x]) {
                int y = xy[idx].second;
                chmin(p[idx], seg_upper.get(y) - x - y);

                seg_upper.set(y, op(seg_upper.get(y), y+x));
                seg_lower.set(y, op(seg_lower.get(y), -y+x));
            }
            for(auto idx: table[x]) {
                int y = xy[idx].second;
                chmin(p[idx], seg_upper.prod(y+1, n) - x - y);
                chmin(p[idx], seg_lower.prod(0, y) - x + y);
            }
        }
    }
    {
        std::vector<int> xs(n), ys(n);
        rep(i,0,n) {
            auto [x, y] = xy[i];
            xs[i] = x + y;
            ys[i] = x - y;
        }
        std::sort(all(xs));
        std::sort(all(ys));
        rep(i,0,n) {
            int ret = 0;
            auto [x, y] = xy[i];
            int xa = x + y, ya = x - y;
            chmax(ret, std::abs(xs[0] - xa));
            chmax(ret, std::abs(xs.back() - xa));
            chmax(ret, std::abs(ys[0] - ya));
            chmax(ret, std::abs(ys.back() - ya));
            p[i] = ret - p[i];
        }
        std::sort(all(p));
        std::cout << p[0] << '\n';
    }
}

}  // namespace ebi

int main() {
    ebi::fast_io();
    int t = 1;
    // std::cin >> t;
    while (t--) {
        ebi::main_();
    }
    return 0;
}
0