結果
問題 | No.2612 Close the Distance |
ユーザー | 👑 Nachia |
提出日時 | 2024-01-19 22:36:06 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 8,263 bytes |
コンパイル時間 | 1,441 ms |
コンパイル使用メモリ | 121,412 KB |
実行使用メモリ | 10,408 KB |
最終ジャッジ日時 | 2024-09-28 04:50:35 |
合計ジャッジ時間 | 15,815 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | WA | - |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | AC | 2 ms
6,940 KB |
ソースコード
#ifdef NACHIA// #define _GLIBCXX_DEBUG#else#define NDEBUG#endif#include <iostream>#include <string>#include <vector>#include <algorithm>#include <utility>#include <queue>#include <array>#include <cmath>#include <atcoder/modint>using namespace std;using i64 = long long;using u64 = unsigned long long;#define rep(i,n) for(i64 i=0; i<(i64)(n); i++)#define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--)const i64 INF = 1001001001001001001;const char* yn(bool x){ return x ? "Yes" : "No"; }template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }template<typename A> using nega_queue = priority_queue<A,vector<A>,greater<A>>;using Modint = atcoder::static_modint<998244353>;#include <iterator>#include <functional>template<class Elem> struct vec;template<class Iter>struct seq_view{using Ref = typename std::iterator_traits<Iter>::reference;using Elem = typename std::iterator_traits<Iter>::value_type;Iter a, b;Iter begin() const { return a; }Iter end() const { return b; }int size() const { return (int)(b-a); }seq_view(Iter first, Iter last) : a(first), b(last) {}seq_view sort() const { std::sort(a, b); return *this; }Ref& operator[](int x){ return *(a+x); }template<class F = std::less<Elem>, class ret = vec<int>> ret sorti(F f = F()) const {ret x(size()); for(int i=0; i<size(); i++) x[i] = i;x().sort([&](int l, int r){ return f(a[l],a[r]); });return x;}template<class ret = vec<Elem>> ret col() const { return ret(begin(), end()); }template<class F = std::equal_to<Elem>, class ret = vec<std::pair<Elem, int>>>ret rle(F eq = F()) const {auto x = ret();for(auto& a : (*this)){if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++;} return x;}template<class F> seq_view sort(F f) const { std::sort(a, b, f); return *this; }Iter uni() const { return std::unique(a, b); }Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); }Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); }int lbi(const Elem& x) const { return lb(x) - a; }int ubi(const Elem& x) const { return ub(x) - a; }seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; }template<class F> Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); }template<class F> Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); }template<class F> Iter when_true_to_false(F f) const {if(a == b) return a;return std::lower_bound(a, b, *a,[&](const Elem& x, const Elem&){ return f(x); });}seq_view same(Elem x) const { return { lb(x), ub(x) }; }template<class F> auto map(F f) const {vec<typename Iter::value_type> r;for(auto& x : *this) r.emp(f(x));return r;}Iter max() const { return std::max_element(a, b); }Iter min() const { return std::min_element(a, b); }template<class F = std::less<Elem>>Iter min(F f) const { return std::min_element(a, b, f); }seq_view rev() const { std::reverse(a, b); return *this; }};template<class Elem>struct vec {using Base = typename std::vector<Elem>;using Iter = typename Base::iterator;using CIter = typename Base::const_iterator;using View = seq_view<Iter>;using CView = seq_view<CIter>;vec(){}explicit vec(int n, const Elem& value = Elem()) : a(0<n?n:0, value) {}template <class I2> vec(I2 first, I2 last) : a(first, last) {}vec(std::initializer_list<Elem> il) : a(std::move(il)) {}vec(Base b) : a(std::move(b)) {}operator Base() const { return a; }Iter begin(){ return a.begin(); }CIter begin() const { return a.begin(); }Iter end(){ return a.end(); }CIter end() const { return a.end(); }int size() const { return a.size(); }bool empty() const { return a.empty(); }Elem& back(){ return a.back(); }const Elem& back() const { return a.back(); }vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; }Iter operator()(int x){ return a.begin() + x; }CIter operator()(int x) const { return a.begin() + x; }View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; }CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; }View operator()(){ return (*this)(0,size()); }CView operator()() const { return (*this)(0,size()); }Elem& operator[](int x){ return a[x]; }const Elem& operator[](int x) const { return a[x]; }Base& operator*(){ return a; }const Base& operator*() const { return a; }vec& push(Elem args){a.push_back(std::move(args));return *this;}template<class... Args>vec& emp(Args &&... args){a.emplace_back(std::forward<Args>(args) ...);return *this;}template<class Range>vec& app(Range& x){ for(auto& v : a) emp(v); }Elem pop(){Elem x = std::move(a.back());a.pop_back(); return x;}bool operator==(const vec& r) const { return a == r.a; }bool operator!=(const vec& r) const { return a != r.a; }bool operator<(const vec& r) const { return a < r.a; }bool operator<=(const vec& r) const { return a <= r.a; }bool operator>(const vec& r) const { return a > r.a; }bool operator>=(const vec& r) const { return a >= r.a; }vec<vec<Elem>> pile(int n) const { return vec<vec<Elem>>(n, *this); }template<class F> vec& filter(F f){int p = 0;for(int q=0; q<size(); q++) if(f(a[q])) std::swap(a[p++],a[q]);a.resize(p); return *this;}private: Base a;};template<class IStr, class U, class T>IStr& operator>>(IStr& is, vec<std::pair<U,T>>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; }template<class IStr, class T>IStr& operator>>(IStr& is, vec<T>& v){ for(auto& x:v){ is >> x; } return is; }template<class OStr, class T>OStr& operator<<(OStr& os, const vec<T>& v){for(int i=0; i<v.size(); i++){if(i){ os << ' '; } os << v[i];} return os;}bool testB(const vec<pair<i64, i64>>& A, const vec<int>& alive, i64 w){i64 minX = INF;i64 maxX = -INF;i64 minY = INF;i64 maxY = -INF;rep(i,A.size()) if(alive[i]){auto [x,y] = A[i];chmin(minX, x); chmax(maxX, x);chmin(minY, y); chmax(maxY, y);}bool ok1 = true;bool ok2 = true;rep(i,A.size()) if(alive[i]){auto [x,y] = A[i];if((minX + w < x || minY + w < y) && (x < maxX - w || y < maxY - w)) ok1 = false;if((minX + w < x || y < maxY - w) && (x < maxX - w || minY + w < y)) ok2 = false;}return ok1 || ok2;}bool testA(const vec<pair<i64, i64>>& A, i64 w){i64 ly = A[0].second;i64 ry = ly;i64 lx = A[0].first;vec<int> alive(A.size(), 1);rep(i,A.size()){auto [x,y] = A[i];if(lx + w < x) break;if(ry - w <= y && y <= ly + w){chmin(ly, y);chmax(ry, y);alive[i] = 0;}}return testB(A, alive, w);}void testcase(){int N; cin >> N;vec<i64> X(N), Y(N);rep(i,N){ i64 x, y; cin >> x >> y; X[i] = x+y-(1<<30); Y[i] = x-y; }i64 okmin = INF;rep(t,2){rep(s,2){rep(q,2){vec<pair<i64,i64>> A(N);rep(i,N) A[i] = { X[i], Y[i] };A().sort();i64 ng = -1, ok = okmin;while(ng + 1 < ok){i64 w = ng + (ok - ng) / 2;bool okb = false;if(!okb && testA(A, w)) okb = true;(okb ? ok : ng) = w;}chmin(okmin, ok);rep(i,N) X[i] = -X[i];}rep(i,N) Y[i] = -Y[i];}swap(X, Y);}cout << okmin << endl;}int main(){ios::sync_with_stdio(false); cin.tie(nullptr);#ifdef NACHIAint T; cin >> T; for(int t=0; t<T; T!=++t?(cout<<'\n'),0:0)#endiftestcase();return 0;}