結果
問題 | No.2354 Poor Sight in Winter |
ユーザー | hari64 |
提出日時 | 2023-06-16 23:02:04 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 198 ms / 2,000 ms |
コード長 | 4,339 bytes |
コンパイル時間 | 2,361 ms |
コンパイル使用メモリ | 214,676 KB |
実行使用メモリ | 7,512 KB |
最終ジャッジ日時 | 2023-09-06 21:48:40 |
合計ジャッジ時間 | 5,520 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
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 | 1 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,384 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,384 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 175 ms
7,344 KB |
testcase_12 | AC | 173 ms
7,088 KB |
testcase_13 | AC | 188 ms
7,508 KB |
testcase_14 | AC | 188 ms
7,512 KB |
testcase_15 | AC | 195 ms
7,288 KB |
testcase_16 | AC | 198 ms
7,356 KB |
testcase_17 | AC | 195 ms
7,344 KB |
testcase_18 | AC | 79 ms
5,504 KB |
testcase_19 | AC | 135 ms
6,580 KB |
testcase_20 | AC | 92 ms
5,764 KB |
testcase_21 | AC | 6 ms
4,380 KB |
testcase_22 | AC | 37 ms
4,376 KB |
testcase_23 | AC | 38 ms
4,376 KB |
testcase_24 | AC | 122 ms
6,360 KB |
testcase_25 | AC | 26 ms
4,380 KB |
testcase_26 | AC | 21 ms
4,380 KB |
testcase_27 | AC | 3 ms
4,376 KB |
testcase_28 | AC | 4 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef __int128_t lll; typedef long double ld; typedef pair<ll, ll> pl; typedef tuple<ll, ll, ll> tt; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<vvl> vvvl; typedef vector<double> vd; typedef vector<vd> vvd; typedef vector<vvd> vvvd; typedef vector<bool> vb; typedef vector<vb> vvb; typedef vector<vvb> vvvb; typedef vector<char> vc; typedef vector<vc> vvc; typedef vector<vvc> vvvc; typedef vector<pl> vp; typedef vector<tt> vt; typedef vector<string> vs; const ll INF = 1000000010; const ll INFL = INF * INF; const double MYPI = acos(-1); const ld epsilon = 1e-10; #define ovl(a, b, c, d, e, ...) e #define pb push_back #define eb emplace_back #define MP make_pair #define DEBUG(...) DEBUG_(#__VA_ARGS__, __VA_ARGS__) #define REP1(i, n) for (int i = 0; i < (n); i++) #define REP2(i, l, r) for (int i = (l); i < (r); i++) #define REP3(i, l, r, d) for (int i = (l); i < (r); i += (d)) #define REP(...) ovl(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__) #define RREP1(i, n) for (int i = (n)-1; i >= 0; i--) #define RREP2(i, l, r) for (int i = (r)-1; i >= (l); i--) #define RREP3(i, l, r, d) for (int i = (r)-1; i >= (l); i -= (d)) #define RREP(...) ovl(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__) #define EACH1(e, a) for (auto &e : a) #define EACH2(x, y, a) for (auto &[x, y] : a) #define EACH3(x, y, z, a) for (auto &[x, y, z] : a) #define EACH(...) ovl(__VA_ARGS__, EACH3, EACH2, EACH1)(__VA_ARGS__) #define ALL(x) begin(x), end(x) #define RALL(x) (x).rbegin(), (x).rend() #define sz(x) (ll) x.size() #define LB(a, x) (lower_bound(ALL(a), x) - a.begin()) #define UB(a, x) (upper_bound(ALL(a), x) - a.begin()) #define FLG(x, i) (((x) >> (i)) & 1) #define CNTBIT(x) __builtin_popcountll(x) #define TOPBIT(t) (t == 0 ? -1 : 63 - __builtin_clzll(t)) #define IN(x, a, b) ((a) <= (x) && (x) < (b)) template <typename T, typename... Ts> void OUT(const T &a, const Ts &...b) { cout << a; (cout << ... << (cout << " ", b)); cout << endl; } template <typename T> void DEBUG_(string_view name, const T &a) { cout << name << ": " << a << endl; } template <typename T> void DEBUG_(string_view name, const vector<T> &a) { cout << name << ": "; REP(i, sz(a)) cout << a[i] << " "; cout << endl; } template <typename T1, typename T2> bool chmax(T1 &x, const T2 &y) { return x < y ? x = y, 1 : 0; } template <typename T1, typename T2> bool chmin(T1 &x, const T2 &y) { return x > y ? x = y, 1 : 0; } // Ο((E+V)logV) cannot reach: INFll vector<long long> dijkstra(const vector<vector<pair<int, long long>>> &adj, int s) { vector<long long> dist(int(adj.size()), INF); priority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> que; dist[s] = 0; que.emplace(dist[s], s); while (!que.empty()) { pair<long long, int> p = que.top(); que.pop(); if (dist[p.second] < p.first) continue; for (pair<int, long long> nv : adj[p.second]) { if (dist[nv.first] > dist[p.second] + nv.second) { dist[nv.first] = dist[p.second] + nv.second; que.emplace(dist[nv.first], nv.first); } } } return dist; } int main() { cin.tie(0); ios::sync_with_stdio(false); int N, K; cin >> N >> K; int sx, sy, gx, gy; cin >> sx >> sy >> gx >> gy; vp XYs(N); REP(i, N) { int x, y; cin >> x >> y; XYs[i] = {x, y}; } XYs.eb(sx, sy); XYs.eb(gx, gy); int s = N; int g = N + 1; N = N + 2; auto is_ok = [&](long long P) -> bool { vector<vector<pair<int, ll>>> adj(N); REP(i, N) { auto [xi, yi] = XYs[i]; REP(j, N) { if (i == j) continue; auto [xj, yj] = XYs[j]; ll dist = abs(xi - xj) + abs(yi - yj); adj[i].eb(j, (dist - 1) / P); } } auto dists = dijkstra(adj, s); return dists[g] <= K; }; long long ok, ng; ok = INF; ng = 0; while (abs(ok - ng) > 1) { long long mid = (ok + ng) / 2; if (is_ok(mid)) { ok = mid; } else { ng = mid; } } OUT(ok); return 0; }