結果

問題 No.2354 Poor Sight in Winter
ユーザー miscalcmiscalc
提出日時 2023-06-16 22:01:34
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 119 ms / 2,000 ms
コード長 3,471 bytes
コンパイル時間 4,246 ms
コンパイル使用メモリ 265,664 KB
実行使用メモリ 4,384 KB
最終ジャッジ日時 2023-09-06 19:49:05
合計ジャッジ時間 6,362 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,376 KB
testcase_06 AC 1 ms
4,376 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 33 ms
4,376 KB
testcase_12 AC 70 ms
4,376 KB
testcase_13 AC 119 ms
4,376 KB
testcase_14 AC 113 ms
4,376 KB
testcase_15 AC 90 ms
4,380 KB
testcase_16 AC 108 ms
4,384 KB
testcase_17 AC 109 ms
4,376 KB
testcase_18 AC 37 ms
4,376 KB
testcase_19 AC 76 ms
4,376 KB
testcase_20 AC 41 ms
4,376 KB
testcase_21 AC 4 ms
4,376 KB
testcase_22 AC 22 ms
4,376 KB
testcase_23 AC 23 ms
4,376 KB
testcase_24 AC 57 ms
4,380 KB
testcase_25 AC 2 ms
4,380 KB
testcase_26 AC 3 ms
4,376 KB
testcase_27 AC 2 ms
4,380 KB
testcase_28 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {ll res = A % M; if (res < 0) res += M; return res;}
ll divfloor(ll A, ll B) {if (B < 0) A = -A, B = -B; return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) A = -A, B = -B; return divfloor(A + B - 1, B);}
ll pow_ll(ll A, ll B) {if (A == 0 || A == 1) {return A;} if (A == -1) {return B & 1 ? -1 : 1;} ll res = 1; for (int i = 0; i < B; i++) {res *= A;} return res;}
ll mul_limited(ll A, ll B, ll M = INF) { return B == 0 ? 0 : A > M / B ? M : A * B; }
ll pow_limited(ll A, ll B, ll M = INF) { if (A == 0 || A == 1) {return A;} ll res = 1; for (int i = 0; i < B; i++) {if (res > M / A) return M; res *= A;} return res;}
ll logfloor(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp <= B / A; tmp *= A) {res++;} return res;}
ll logceil(ll A, ll B) {assert(A >= 2); ll res = 0; for (ll tmp = 1; tmp < B; tmp *= A) {res++;} return res;}
ll arisum_ll(ll a, ll d, ll n) { return n * a + (n & 1 ? ((n - 1) >> 1) * n : (n >> 1) * (n - 1)) * d; }
ll arisum2_ll(ll a, ll l, ll n) { return n & 1 ? ((a + l) >> 1) * n : (n >> 1) * (a + l); }
ll arisum3_ll(ll a, ll l, ll d) { assert((l - a) % d == 0); return arisum2_ll(a, l, (l - a) / d + 1); }
template<class T> void unique(vector<T> &V) {V.erase(unique(V.begin(), V.end()), V.end());}
template<class T> void sortunique(vector<T> &V) {sort(V.begin(), V.end()); V.erase(unique(V.begin(), V.end()), V.end());}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)
template<class T> void printvec(const vector<T> &V) {int _n = V.size(); for (int i = 0; i < _n; i++) cout << V[i] << (i == _n - 1 ? "" : " ");cout << '\n';}
template<class T> void printvect(const vector<T> &V) {for (auto v : V) cout << v << '\n';}
template<class T> void printvec2(const vector<vector<T>> &V) {for (auto &v : V) printvec(v);}
//*
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;
//*/

int main()
{
  ll N, K;
  cin >> N >> K;
  ll sx, sy, gx, gy;
  cin >> sx >> sy >> gx >> gy;
  vector<pll> XY(N + 1);
  XY.at(0) = {sx, sy};
  for (ll i = 0; i < N; i++)
  {
    ll x, y;
    cin >> x >> y;
    XY.at(i + 1) = {x, y};
  }
  XY.push_back({gx, gy});

  auto isok = [&](ll p) -> bool
  {
    vector<ll> dists(N + 2, INF);
    dists.at(0) = 0;
    priority_queue<pll, vector<pll>, greater<pll>> pque;
    pque.push({0, 0});
    while (!pque.empty())
    {
      auto [d, i] = pque.top();
      pque.pop();

      if (d != dists.at(i))
        continue;

      auto [x, y] = XY.at(i);
      for (ll ni = 0; ni < N + 2; ni++)
      {
        auto [nx, ny] = XY.at(ni);
        ll md = abs(nx - x) + abs(ny - y);
        ll dd = max(0LL, (md - 1) / p);
        if (chmin(dists.at(ni), dists.at(i) + dd))
          pque.push({d + dd, ni});
      }
    }
    /*
    cout << p << "  ";
    printvec(dists);
    //*/
    return dists.at(N + 1) <= K;
  };

  ll ng = 0, ok = 1;
  while (!isok(ok))
    ok *= 2;
  while (abs(ok - ng) > 1)
  {
    ll mid = (ok + ng) / 2;
    if (isok(mid))
      ok = mid;
    else
      ng = mid;
  }
  cout << ok << endl;
}
0