結果
問題 | No.2695 Warp Zone |
ユーザー |
|
提出日時 | 2024-03-26 20:27:50 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 14 ms / 2,000 ms |
コード長 | 4,047 bytes |
コンパイル時間 | 4,136 ms |
コンパイル使用メモリ | 279,456 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-09-30 14:25:17 |
合計ジャッジ時間 | 5,003 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 24 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#define SELECTER(_1,_2,_3,SELECT,...) SELECT#define rep1(i,n) for(int i=0;i<(int)n;++i)#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT#define rrep1(i,n) for(int i=(int)(n)-1;i>=0;--i)#define rrep2(i,a,n) for(int i=(int)(n)-1;i>=(int)a;--i)#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)#define all(a) a.begin(),a.end()#define rall(a) a.rbegin(),a.rend()#define fi first#define se second#define PrintR LogOutput#ifdef _DEBUG#define Log(...) LogOutput(__VA_ARGS__)#else#define Log(...)#endif#define M_PI 3.14159265358979323846using namespace std;using namespace atcoder;using ll=long long;using ld=long double;using pii=pair<int,int>;using pll=pair<long long,long long>;using pdd=pair<long double,long double>;using tp=tuple<int,int,int>;using tpll=tuple<ll,ll,ll>;using veci=vector<int>;using vecpii=vector<pair<int,int>>;using vecll=vector<long long>;using vecpll=vector<pair<long long,long long>>;using vecpdd=vector<pair<long double,long double>>;using vecs=vector<string>;using vecb=vector<bool>;using vecd=vector<long double>;using vectp=vector<tp>;using vectpll=vector<tpll>;using mint=modint998244353;using mint10=modint1000000007;template<typename T, typename S>istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}template<typename T, typename S>ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}ostream& operator<<(ostream& out, const mint& a){return out << a.val();}ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}ostream& operator<<(ostream& out, const modint& a){return out << a.val();}template<typename T>ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}template<typename T, typename S>pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}template<typename T, typename S>pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}bool PrintA(int i){cout<<(i ? "Yes" : "No")<<endl;return i;}constexpr ll INF=numeric_limits<ll>::max() >> 2;constexpr int inf=numeric_limits<int>::max() >> 1;constexpr ll MOD=998244353;const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};template<typename... Args>void LogOutput(Args&&... args){stringstream ss;((ss << args << ' '), ...);cout << ss.str().substr(0, ss.str().length() - 1) << endl;}template<typename T>void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}int main(){ios::sync_with_stdio(false);std::cin.tie(nullptr);int h, w, n;cin>>h>>w>>n;vecpii t;t.emplace_back(1, 1);t.emplace_back(h, w);vecpii a(n), b(n);rep(i, n){cin>>a[i]>>b[i];t.emplace_back(a[i]);t.emplace_back(b[i]);}sort(all(t));t.erase(unique(all(t)), t.end());vector<veci> g(t.size());veci idx(n);rep(i, n){int v = lower_bound(all(t), a[i]) - t.begin();int v2 = lower_bound(all(t), b[i]) - t.begin();g[v].push_back(v2);idx[i] = v;}priority_queue<pll, vecpll, greater<pll>> q;q.emplace(0, 0);vecll dist(t.size(), INF);dist[0] = 0;while(q.size()){auto [c, v] = q.top(); q.pop();if(dist[v] < c) continue;for(int nv : g[v]) if(chmin(dist[nv], dist[v] + 1))q.emplace(dist[nv], nv);rep(i, t.size()) if(chmin(dist[i], dist[v] + abs(t[v].fi - t[i].fi) + abs(t[v].se - t[i].se)))q.emplace(dist[i], i);}cout<<dist[t.size() - 1]<<endl;}