#945144 (C++23) No.2612 Close the Distance

提出ソース

結果

問題	No.2612 Close the Distance
ユーザー	risujiroh
提出日時	2024-01-19 22:35:56
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	1,965 ms / 3,000 ms
コード長	6,602 bytes
コンパイル時間	4,137 ms
コンパイル使用メモリ	305,224 KB
実行使用メモリ	7,936 KB
最終ジャッジ日時	2024-02-26 18:38:44
合計ジャッジ時間	32,633 ms
ジャッジサーバーID （参考情報）	judge13 / judge10

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,548 KB
testcase_01	AC	1 ms 6,548 KB
testcase_02	AC	2 ms 6,548 KB
testcase_03	AC	2 ms 6,548 KB
testcase_04	AC	2 ms 6,548 KB
testcase_05	AC	2 ms 6,548 KB
testcase_06	AC	635 ms 7,936 KB
testcase_07	AC	967 ms 7,936 KB
testcase_08	AC	1,012 ms 7,936 KB
testcase_09	AC	957 ms 7,936 KB
testcase_10	AC	1,019 ms 7,936 KB
testcase_11	AC	1,036 ms 7,936 KB
testcase_12	AC	1,088 ms 7,936 KB
testcase_13	AC	1,043 ms 7,936 KB
testcase_14	AC	1,149 ms 7,936 KB
testcase_15	AC	813 ms 7,936 KB
testcase_16	AC	1,795 ms 7,936 KB
testcase_17	AC	1,530 ms 7,936 KB
testcase_18	AC	1,721 ms 7,936 KB
testcase_19	AC	1,762 ms 7,936 KB
testcase_20	AC	1,656 ms 7,936 KB
testcase_21	AC	1,857 ms 7,936 KB
testcase_22	AC	1,488 ms 7,936 KB
testcase_23	AC	1,600 ms 7,936 KB
testcase_24	AC	1,965 ms 7,936 KB
testcase_25	AC	1,523 ms 7,936 KB
testcase_26	AC	2 ms 6,548 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  int n;
  scan(n);
  std::vector<int> x(n), y(n);
  for (const int i : rep(n)) {
    scan(x[i], y[i]);
    std::tie(x[i], y[i]) = std::pair(x[i] + y[i], y[i] - x[i]);
  }
  const auto check = [&](int d) -> bool {
    for (const int mask : rep(1 << 3)) {
      std::basic_string<bool> alive(n, true);
      for (const int c : rep(3)) {
        int lx;
        if (mask >> (c * 2) & 1) {
          lx = ranges::min(rep(n) | views::filter(at(alive, _1)) | views::transform(at(x, _1)));
        } else {
          lx = ranges::max(rep(n) | views::filter(at(alive, _1)) | views::transform(at(x, _1))) - d;
        }
        int ly;
        if (mask >> (c * 2 + 1) & 1) {
          ly = ranges::min(rep(n) | views::filter(at(alive, _1)) | views::transform(at(y, _1)));
        } else {
          ly = ranges::max(rep(n) | views::filter(at(alive, _1)) | views::transform(at(y, _1))) - d;
        }
        for (const int i : rep(n)) {
          if (lx <= x[i] && x[i] <= lx + d && ly <= y[i] && y[i] <= ly + d) {
            alive[i] = false;
          }
        }
        if (ranges::find(alive, true) == alive.end()) {
          return true;
        }
      }
    }
    return false;
  };
  int ng = -1;
  {
    auto vx = x;
    auto vy = y;
    ranges::sort(vx);
    ranges::sort(vy);
    int sx = vx.back() - vx[0];
    int sy = vy.back() - vy[0];
    std::vector<int> dx(n - 1);
    std::vector<int> dy(n - 1);
    for (const int i : rep(n - 1)) {
      dx[i] = vx[i + 1] - vx[i];
      dy[i] = vy[i + 1] - vy[i];
    }
    ranges::sort(dx, std::greater{});
    ranges::sort(dy, std::greater{});
    for (const int i : rep(std::min(2, n - 1))) {
      sx -= dx[i];
      sy -= dy[i];
    }
    chmax(ng, std::max(sx, sy) / 3 - 1);
  }
  int ok = std::max(ranges::max(x) - ranges::min(x), ranges::max(y) - ranges::min(y));
  while (ng + 1 < ok) {
    const int mid = std::midpoint(ng, ok);
    (check(mid) ? ok : ng) = mid;
  }
  print(ok);
}

// 3 色
// 正方形
// 一番下の点
// ギリギリじゃないと損
// 全探索

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept TupleLike = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, TupleLike auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  string_view sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, TupleLike auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

#define DEF_INC_OR_DEC(op) \
  auto& operator op(Range auto&& r) { \
    for (auto&& e : r) { \
      op e; \
    } \
    return r; \
  } \
  auto& operator op(TupleLike auto&& t) { \
    apply([](auto&... xs) { (op xs, ...); }, t); \
    return t; \
  }

DEF_INC_OR_DEC(++)
DEF_INC_OR_DEC(--)

#undef DEF_INC_OR_DEC

}  // namespace std

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

#define FWD(...) static_cast<decltype(__VA_ARGS__)&&>(__VA_ARGS__)

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const { return f_(std::ref(*this), FWD(xs)...); }

 private:
  F f_;
};

template <class T>
concept LambdaExpr = std::is_placeholder_v<std::remove_cvref_t<T>> != 0 ||
                     std::is_bind_expression_v<std::remove_cvref_t<T>>;

auto operator++(LambdaExpr auto&& x, int) {
  return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)++; }, FWD(x));
}

auto operator--(LambdaExpr auto&& x, int) {
  return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)--; }, FWD(x));
}

#define DEF_UNARY_OP(op) \
  auto operator op(LambdaExpr auto&& x) { \
    return std::bind([](auto&& x) -> decltype(auto) { return op FWD(x); }, FWD(x)); \
  }

DEF_UNARY_OP(++)
DEF_UNARY_OP(--)
DEF_UNARY_OP(+)
DEF_UNARY_OP(-)
DEF_UNARY_OP(~)
DEF_UNARY_OP(!)
DEF_UNARY_OP(*)
DEF_UNARY_OP(&)

#undef DEF_UNARY_OP

#define DEF_BINARY_OP(op) \
  template <class T1, class T2> \
    requires LambdaExpr<T1> || LambdaExpr<T2> \
  auto operator op(T1&& x, T2&& y) { \
    return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x) op FWD(y); }, \
                     FWD(x), FWD(y)); \
  }

DEF_BINARY_OP(+=)
DEF_BINARY_OP(-=)
DEF_BINARY_OP(*=)
DEF_BINARY_OP(/=)
DEF_BINARY_OP(%=)
DEF_BINARY_OP(^=)
DEF_BINARY_OP(&=)
DEF_BINARY_OP(|=)
DEF_BINARY_OP(<<=)
DEF_BINARY_OP(>>=)
DEF_BINARY_OP(+)
DEF_BINARY_OP(-)
DEF_BINARY_OP(*)
DEF_BINARY_OP(/)
DEF_BINARY_OP(%)
DEF_BINARY_OP(^)
DEF_BINARY_OP(&)
DEF_BINARY_OP(|)
DEF_BINARY_OP(<<)
DEF_BINARY_OP(>>)
DEF_BINARY_OP(==)
DEF_BINARY_OP(!=)
DEF_BINARY_OP(<)
DEF_BINARY_OP(>)
DEF_BINARY_OP(<=)
DEF_BINARY_OP(>=)
DEF_BINARY_OP(&&)
DEF_BINARY_OP(||)

#undef DEF_BINARY_OP

template <class T1, class T2>
  requires LambdaExpr<T1> || LambdaExpr<T2>
auto at(T1&& x, T2&& y) {
  return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x)[FWD(y)]; }, FWD(x),
                   FWD(y));
}

template <int I>
auto get(LambdaExpr auto&& x) {
  return std::bind([](auto&& x) -> decltype(auto) { return std::get<I>(FWD(x)); }, FWD(x));
}

inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }

using namespace std::literals;
using namespace std::placeholders;

namespace ranges = std::ranges;
namespace views = std::views;

using i64 = std::int64_t;

#endif  // __INCLUDE_LEVEL__

yukicoder

結果

テストケース

ソースコード