結果
問題 | No.2695 Warp Zone |
ユーザー | sgfc |
提出日時 | 2024-03-22 21:57:23 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 266 ms / 2,000 ms |
コード長 | 4,106 bytes |
コンパイル時間 | 8,786 ms |
コンパイル使用メモリ | 472,904 KB |
実行使用メモリ | 35,456 KB |
最終ジャッジ日時 | 2024-03-22 21:57:35 |
合計ジャッジ時間 | 10,577 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 211 ms
35,456 KB |
testcase_04 | AC | 219 ms
34,816 KB |
testcase_05 | AC | 204 ms
34,816 KB |
testcase_06 | AC | 266 ms
35,328 KB |
testcase_07 | AC | 217 ms
35,456 KB |
testcase_08 | AC | 2 ms
6,676 KB |
testcase_09 | AC | 46 ms
15,872 KB |
testcase_10 | AC | 1 ms
6,676 KB |
testcase_11 | AC | 11 ms
7,424 KB |
testcase_12 | AC | 77 ms
20,864 KB |
testcase_13 | AC | 2 ms
6,676 KB |
testcase_14 | AC | 92 ms
25,472 KB |
testcase_15 | AC | 44 ms
14,336 KB |
testcase_16 | AC | 10 ms
6,676 KB |
testcase_17 | AC | 24 ms
9,856 KB |
testcase_18 | AC | 148 ms
30,464 KB |
testcase_19 | AC | 2 ms
6,676 KB |
testcase_20 | AC | 195 ms
27,520 KB |
testcase_21 | AC | 137 ms
25,088 KB |
testcase_22 | AC | 33 ms
11,392 KB |
testcase_23 | AC | 65 ms
20,608 KB |
testcase_24 | AC | 2 ms
6,676 KB |
testcase_25 | AC | 2 ms
6,676 KB |
testcase_26 | AC | 2 ms
6,676 KB |
ソースコード
#include "bits/stdc++.h" #include <stdio.h> #include <math.h> #include "atcoder/all" #include <float.h> #include <boost/multiprecision/cpp_int.hpp> using namespace boost::multiprecision; using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using mint = modint998244353; using mint2 = modint1000000007; const double eps = 1e-9; #define REP(i, n) for (ll i = 0; i < ll(n); ++i) #define REPI(i, init, n) for (ll i = init; i < ll(n); ++i) #define REPD(i, init) for (ll i = init; i >=0; --i) #define REPDI(i, init, n) for (ll i = init; i >=n; --i) #define REPE(i, c) for (const auto& i : c) #define TCASE() ll _ttt; cin >> _ttt; while(_ttt--) using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; #define VL(a, n) vector<ll> a; a.assign(n, 0); #define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x; #define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x; #define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init); using vd = vector<double>; using pl = pair<ll, ll>; struct uv { ll u; ll v; ll c; }; #define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;} #define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;} vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; } vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; } template <class T = long long> using pql = priority_queue<T>; template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>; using vm = vector<mint>; using vvm = vector<vm>; void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; }; template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } }; template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } }; const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値 auto gmax(const auto& a, const auto& b) { return a > b ? a : b; }; auto gmin(const auto& a, const auto& b) { return a < b ? a : b; }; bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; } bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; } template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); }; template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); }; template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); }; template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); } long long ceil(const long long a, const long long b) { return (a + b - 1) / b; } struct xy { ll x; ll y; }; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll h, w, n; cin >> h >> w >> n; vector<xy> pts(n+2); pts[n] = { 0,0 }; pts[n+1] = { h-1,w-1 }; vector<xy> warps(n+2); REP(i, n) { ll a, b, c, d; cin >> a >> b >> c >> d; a--; b--; c--; d--; pts[i] = { a, b }; warps[i] = { c, d }; } vector<vector<pair<ll, ll>>> g(n + 2, vector<pair<ll, ll>>()); REP(i, n + 1) { REP(j, n + 2) { if (i == j) continue; ll dist = abs(pts[i].x - pts[j].x) + abs(pts[i].y - pts[j].y); g[i].push_back({ j, dist }); if (i < n) { dist = abs(pts[j].x - warps[i].x) + abs(pts[j].y - warps[i].y); g[i].push_back({ j, dist + 1 }); } } } pql<pair<ll, ll>> pq; pq.push({ 0, n }); vector<ll> dist(n + 2, llhuge); dist[n] = 0; while (!pq.empty()) { auto [d, v] = pq.top(); pq.pop(); if (dist[v] < d) continue; REPE(e, g[v]) { auto [nv, nd] = e; if (chmin(dist[nv], dist[v] + nd)) { pq.push({ dist[nv], nv }); } } } cout << dist[n + 1] << endl; }