結果
問題 | No.2695 Warp Zone |
ユーザー |
|
提出日時 | 2024-03-22 22:13:07 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 2,305 bytes |
コンパイル時間 | 2,782 ms |
コンパイル使用メモリ | 263,376 KB |
実行使用メモリ | 68,352 KB |
最終ジャッジ日時 | 2024-09-30 11:41:58 |
合計ジャッジ時間 | 4,383 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define rep(i, a, n) for(int i = a; i < n; i++) #define rrep(i, a, n) for(int i = a; i >= n; i--) #define ll long long #define pii pair<int, int> #define pll pair<ll, ll> // constexpr ll MOD = 1000000007; constexpr ll MOD = 998244353; constexpr int IINF = 1001001001; constexpr ll INF = 1LL<<60; template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;} template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;} vector<ll> dijk(ll s, vector<vector<pll>> &g){ priority_queue<pll, vector<pll>, greater<pll>> que; vector<ll> dist(g.size(), (1LL<<60)); que.push(make_pair(0, s)); dist[s] = 0; while(!que.empty()){ pll q = que.top(); que.pop(); ll d = q.first, u = q.second; if(dist[u] < d) continue; for(auto nq: g[u]){ ll v = nq.first, cost = nq.second; if(dist[v] > d+cost){ dist[v] = d+cost; que.push({dist[v], v}); } } } return dist; } int main(){ int h, w, n; cin >> h >> w >> n; vector<vector<pair<ll, ll>>> g(2*n+2); vector<ll> a(n), b(n), c(n), d(n); rep(i, 0, n) cin >> a[i] >> b[i] >> c[i] >> d[i]; rep(i, 0, n){ g[2*i].push_back({2*i+1, 1}); g[2*i+1].push_back({2*i, abs(a[i]-c[i])+abs(b[i]-d[i])}); } rep(i, 0, n){ rep(j, i+1, n){ g[2*i].push_back({2*j, abs(a[i]-a[j])+abs(b[i]-b[j])}); g[2*j].push_back({2*i, abs(a[i]-a[j])+abs(b[i]-b[j])}); g[2*i].push_back({2*j+1, abs(a[i]-c[j])+abs(b[i]-d[j])}); g[2*j+1].push_back({2*i, abs(a[i]-c[j])+abs(b[i]-d[j])}); g[2*i+1].push_back({2*j, abs(c[i]-a[j])+abs(d[i]-b[j])}); g[2*j].push_back({2*i+1, abs(c[i]-a[j])+abs(d[i]-b[j])}); g[2*i+1].push_back({2*j+1, abs(c[i]-c[j])+abs(d[i]-d[j])}); g[2*j+1].push_back({2*i+1, abs(c[i]-c[j])+abs(d[i]-d[j])}); } } rep(i, 0, n){ g[2*n].push_back({2*i, a[i]-1+b[i]-1}); g[2*i].push_back({2*n+1, h-a[i]+w-b[i]}); g[2*i+1].push_back({2*n+1, h-c[i]+w-d[i]}); } g[2*n].push_back({2*n+1, h-1+w-1}); vector<ll> dist = dijk(2*n, g); cout << dist[2*n+1] << endl; return 0; }