#881821 (C++17) No.2354 Poor Sight in Winter

提出ソース

結果

問題	No.2354 Poor Sight in Winter
ユーザー	KoD
提出日時	2023-06-16 22:13:37
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	25 ms / 2,000 ms
コード長	7,020 bytes
コンパイル時間	1,393 ms
コンパイル使用メモリ	145,272 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-06-24 14:40:49
合計ジャッジ時間	2,412 ms
ジャッジサーバーID （参考情報）	judge5 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	1 ms 6,944 KB
testcase_06	AC	2 ms 6,940 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	1 ms 6,940 KB
testcase_09	AC	1 ms 6,944 KB
testcase_10	AC	2 ms 6,940 KB
testcase_11	AC	18 ms 6,940 KB
testcase_12	AC	18 ms 6,940 KB
testcase_13	AC	25 ms 6,940 KB
testcase_14	AC	23 ms 6,940 KB
testcase_15	AC	20 ms 6,940 KB
testcase_16	AC	21 ms 6,944 KB
testcase_17	AC	23 ms 6,944 KB
testcase_18	AC	9 ms 6,944 KB
testcase_19	AC	16 ms 6,944 KB
testcase_20	AC	11 ms 6,944 KB
testcase_21	AC	2 ms 6,944 KB
testcase_22	AC	5 ms 6,940 KB
testcase_23	AC	6 ms 6,940 KB
testcase_24	AC	13 ms 6,940 KB
testcase_25	AC	4 ms 6,940 KB
testcase_26	AC	4 ms 6,940 KB
testcase_27	AC	2 ms 6,944 KB
testcase_28	AC	3 ms 6,940 KB

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

ソースコード

raw source code

// #define MULTEST

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <variant>
#include <vector>

namespace kod {
namespace util {

template <class F> class fixed_point : private F {
  constexpr fixed_point(F&& f) noexcept : F(std::forward<F>(f)) {}
  template <class G> friend constexpr decltype(auto) make_fixed(G&&) noexcept;

 public:
  template <class... Args> constexpr decltype(auto) operator()(Args&&... args) const noexcept {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};

template <class G> [[nodiscard]] constexpr decltype(auto) make_fixed(G&& g) noexcept {
  using F = std::decay_t<G>;
  return fixed_point<F>(std::forward<F>(g));
}

}  // namespace util
}  // namespace kod

namespace kod {
namespace util {

class forward_loop {
  int x, y;
  constexpr forward_loop(int x, int y) noexcept : x(x), y(y) {}
  friend constexpr forward_loop rep(int, int) noexcept;
  friend constexpr forward_loop rep(int) noexcept;

 public:
  constexpr forward_loop begin() const noexcept { return *this; }
  constexpr std::monostate end() const noexcept { return {}; }
  constexpr bool operator!=(std::monostate) const noexcept { return x < y; }
  constexpr void operator++() const noexcept {}
  constexpr int operator*() noexcept { return x++; }
};

[[nodiscard]] constexpr forward_loop rep(int l, int r) noexcept { return forward_loop(l, r); }
[[nodiscard]] constexpr forward_loop rep(int n) noexcept { return forward_loop(0, n); }

class backward_loop {
  int x, y;
  constexpr backward_loop(int x, int y) noexcept : x(x), y(y) {}
  friend constexpr backward_loop revrep(int, int) noexcept;
  friend constexpr backward_loop revrep(int) noexcept;

 public:
  constexpr backward_loop begin() const noexcept { return *this; }
  constexpr std::monostate end() const noexcept { return {}; }
  constexpr bool operator!=(std::monostate) const noexcept { return x > y; }
  constexpr void operator++() const noexcept {}
  constexpr int operator*() noexcept { return --x; }
};

[[nodiscard]] constexpr backward_loop revrep(int l, int r) noexcept { return backward_loop(r, l); }
[[nodiscard]] constexpr backward_loop revrep(int n) noexcept { return backward_loop(n, 0); }

template <class F> constexpr void repeat(int n, const F& f) noexcept {
  assert(n >= 0);
  while (n--) f();
}

}  // namespace util
}  // namespace kod

namespace kod {
namespace util {

namespace stdio_impl {

template <class T> T scan() {
  T x;
  std::cin >> x;
  return x;
}
struct scan_any {
  template <class T> operator T() const { return scan<T>(); }
};

}  // namespace stdio_impl

template <class T = void> decltype(auto) scan() {
  if constexpr (std::is_same_v<T, void>) return stdio_impl::scan_any{};
  else return stdio_impl::scan<T>();
}
template <class T, std::size_t N> std::array<T, N> scan_arr() {
  std::array<T, N> a;
  for (auto& x : a) x = scan<T>();
  return a;
}
template <class T> std::vector<T> scan_vec(int n) {
  if (n == -1) n = scan<int>();
  assert(n >= 0);
  std::vector<T> v;
  v.reserve(n);
  while (n--) v.push_back(scan<T>());
  return v;
}

void flush() { std::cout << std::flush; }
void print() {}
template <class T, class... Args> void print(const T& x, const Args&... args) {
  std::cout << x;
  if (sizeof...(args) != 0) std::cout << ' ';
  print(args...);
}
template <class... Args> void println(const Args&... args) {
  print(args...);
  std::cout << '\n';
}
template <class C> void print_seq(const C& c, const char* sep = " ", const char* end = "\n") {
  bool f = false;
  for (const auto& x : c) {
    if (f) std::cout << sep;
    else f = true;
    std::cout << x;
  }
  std::cout << end;
}

}  // namespace util
}  // namespace kod

namespace kod {
namespace sol {

using ll = long long;
using uint = unsigned;
using ull = unsigned long long;

using std::array;
using std::pair;
using std::string;
using std::tuple;
using std::vector;

using namespace util;

constexpr int inf = std::numeric_limits<int>::max() / 2;
constexpr ll infll = std::numeric_limits<ll>::max() / 2;

constexpr ll floor_div(ll x, ll y) noexcept {
  assert(y != 0);
  return x / y - ((x ^ y) < 0 && x % y != 0);
}
constexpr ll ceil_div(ll x, ll y) noexcept {
  assert(y != 0);
  return x / y + ((x ^ y) >= 0 && x % y != 0);
}

template <class T> constexpr bool setmin(T& lhs, const T& rhs) noexcept {
  if (lhs > rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}
template <class T> constexpr bool setmax(T& lhs, const T& rhs) noexcept {
  if (lhs < rhs) {
    lhs = rhs;
    return true;
  }
  return false;
}

void run();

}  // namespace sol
}  // namespace kod

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);
  std::cout << std::fixed << std::setprecision(20);
  int cases = 1;
#ifdef MULTEST
  std::cin >> cases;
#endif
  while (cases--) kod::sol::run();
  return 0;
}

#ifdef KOD_LOCAL
#define OJ_LOCAL(a, b) b
#include <kodlib/misc/debug>
#else
#define OJ_LOCAL(a, b) a
#define DBG(...)
#define SHOW(...)
#endif

namespace kod {
namespace sol {

template <class T, class F, std::enable_if_t<std::is_integral_v<T>>* = nullptr> T binary_search(T ok, T ng, const F& f) {
  using U = std::make_unsigned_t<T>;
  assert(ok != ng);
  if (ok < ng) {
    while (ok + 1 != ng) {
      const T md = ok + T((U(ng) - U(ok)) >> 1);
      (f(md) ? ok : ng) = md;
    }
  } else {
    while (ng + 1 != ok) {
      const T md = ng + T((U(ok) - U(ng)) >> 1);
      (f(md) ? ok : ng) = md;
    }
  }
  return ok;
}

void run() {
  const int n = scan<int>() + 2;
  const int k = scan();
  vector<pair<int, int>> xy(n);
  for (auto& [x, y] : xy) {
    x = scan();
    y = scan();
  }

  vector edge(n, vector(n, 0));
  const auto calc = [&](const int p) {
    for (const int i : rep(n)) {
      for (const int j : rep(i)) {
        const int d = std::abs(xy[i].first - xy[j].first) + std::abs(xy[i].second - xy[j].second);
        edge[i][j] = edge[j][i] = (d - 1) / p;
      }
    }
    struct info {
      int u, d;
      bool operator<(const info& t) const { return d > t.d; }
    };
    std::priority_queue<info> heap;
    vector<int> dist(n, inf);
    const auto push = [&](const int u, const int d) {
      if (setmin(dist[u], d)) {
        heap.push({u, d});
      }
    };
    push(0, 0);
    while (!heap.empty()) {
      const auto [u, d] = heap.top();
      heap.pop();
      if (dist[u] < d) continue;
      for (const int v : rep(n)) {
        push(v, dist[u] + edge[u][v]);
      }
    }
    return dist[1];
  };

  println(binary_search(200000, 0, [&](const int p) { return calc(p) <= k; }));
}

}  // namespace sol
}  // namespace kod

yukicoder

結果

テストケース

ソースコード