結果

問題 No.2695 Warp Zone
ユーザー coindarwcoindarw
提出日時 2024-03-22 22:41:29
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 239 ms / 2,000 ms
コード長 6,778 bytes
コンパイル時間 5,997 ms
コンパイル使用メモリ 329,532 KB
実行使用メモリ 133,632 KB
最終ジャッジ日時 2024-03-22 22:41:39
合計ジャッジ時間 9,085 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 239 ms
133,632 KB
testcase_04 AC 226 ms
130,816 KB
testcase_05 AC 236 ms
130,944 KB
testcase_06 AC 231 ms
132,736 KB
testcase_07 AC 234 ms
133,504 KB
testcase_08 AC 3 ms
6,676 KB
testcase_09 AC 85 ms
62,720 KB
testcase_10 AC 2 ms
6,676 KB
testcase_11 AC 23 ms
19,456 KB
testcase_12 AC 117 ms
79,232 KB
testcase_13 AC 2 ms
6,676 KB
testcase_14 AC 149 ms
94,336 KB
testcase_15 AC 76 ms
58,496 KB
testcase_16 AC 21 ms
18,048 KB
testcase_17 AC 40 ms
28,672 KB
testcase_18 AC 179 ms
110,208 KB
testcase_19 AC 2 ms
6,676 KB
testcase_20 AC 160 ms
100,992 KB
testcase_21 AC 144 ms
92,928 KB
testcase_22 AC 52 ms
36,096 KB
testcase_23 AC 118 ms
78,976 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
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>

#include <atcoder/all>
#else
#include <mylibs/all.h>
#endif

using ll = long long;
using lll = __int128_t;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; --i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define repc2(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define length(v) ((int)(v).size())
constexpr int inf = 2'000'000'000;
constexpr ll linf = 4'000'000'000'000'000'000, M7 = 1'000'000'007, M9 = 998'244'353;
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
using namespace std;
using namespace atcoder;

// clang-format off
#define Vec(type, ...) __make_vec<type>(__VA_ARGS__)
template <class T> vector<T> __make_vec(size_t a) {return vector<T>(a);}template <class T, class... Ts>
auto __make_vec(size_t a, Ts... ts) {return vector<decltype(__make_vec<T>(ts...))>(a, __make_vec<T>(ts...));}
#define VecI(init, type, ...) __make_vecI<type, init>(__VA_ARGS__)
template <class T, T init>vector<T> __make_vecI(size_t a) {return vector<T>(a, init);}
template <class T, T init, class... Ts>
auto __make_vecI(size_t a, Ts... ts) {return vector<decltype(__make_vecI<T, init>(ts...))>(a, __make_vecI<T, init>(ts...));}

template <typename T, typename U>inline ostream& operator<<(ostream& os, const pair<T, U>& p) noexcept {return os << p.first << " " << p.second;}
inline ostream& operator<<(ostream& os, const modint& m) noexcept { return os << m.val(); }
template <int M>inline ostream& operator<<(ostream& os, const static_modint<M>& m) noexcept { return os << m.val(); }

template <typename T> struct is_static_modint : std::false_type {}; template <int MOD> struct is_static_modint<static_modint<MOD>> : std::true_type {};
template <template <typename...> typename C, typename Number>concept MyContainer = std::is_same_v<C<Number>, std::vector<Number>> || std::is_same_v<C<Number>, std::deque<Number>> || std::is_same_v<C<Number>, std::set<Number>> || std::is_same_v<C<Number>, std::unordered_set<Number>> || std::is_same_v<C<Number>, std::unordered_multiset<Number>> || std::is_same_v<C<Number>, std::multiset<Number>>;
template <typename Number>concept MyNumber = std::is_same_v<Number, int> || std::is_same_v<Number, ll> || std::is_same_v<Number, char> || std::is_same_v<Number, modint> || is_static_modint<Number>::value;
template <template <typename...> typename C, typename Number>concept MyContainerNumber = MyContainer<C, Number> && MyNumber<Number>;
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>concept MyNestedContainerNumber = MyContainer<OutCon, InCon<Number>> && MyContainerNumber<InCon, Number>;
template <template <typename...> typename C, typename Number>requires MyContainerNumber<C, Number>std::ostream& operator<<(std::ostream& os, const C<Number>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << ' ' << *itr;}return os;}
template <template <typename...> typename OutCon, template <typename...> typename InCon, typename Number>requires MyNestedContainerNumber<OutCon, InCon, Number>std::ostream& operator<<(std::ostream& os, const OutCon<InCon<Number>>& t) {auto itr = t.begin();auto end = t.end();if (itr != end) {os << *itr++;for (; itr != end; ++itr) os << '\n' << *itr;}return os;}
template <typename T, typename U>istream& operator>>(istream& is, pair<T, U>& p) {return is >> p.first >> p.second;}
template <typename T>istream& operator>>(istream& is, vector<T>& v) {for (auto& e : v) is >> e;return is;}
void inp() {}
template <typename T, typename... Args>void inp(T& a, Args&... args) {cin >> a, inp(args...);}
template <typename T>void inp1(vector<T>& v, int offset = 1, int len = -1) {if (len == -1) len = int(v.size()) - offset;assert(offset >= 0 && len >= 0);for (int i = offset; i < offset + len; ++i) cin >> v[i];}
template <typename T>void oup(const T& a) {cout << a << "\n";}
template <typename T, typename... Args>void oup(const T& a, const Args&... args) {cout << a << " ", oup(args...);}

inline string YESNO(bool cond) { return cond ? "YES" : "NO"; }inline string yesno(bool cond) { return cond ? "yes" : "no"; }inline string YesNo(bool cond) { return cond ? "Yes" : "No"; }
inline auto add1(auto vec, ll offset = 1) {for (auto& e : vec) e += offset;return vec;}
#ifdef ONLINE_JUDGE
#define debug(...)
#else
#define debug(...) cerr << "<" << #__VA_ARGS__ << ">: ", debug_out(__VA_ARGS__)
template <typename T>void debug_out(T t) {cerr << t << "\n";}
template <typename T, typename... Args>void debug_out(T t, Args... args) {cerr << t << ", ";debug_out(args...);}
#endif

#ifdef ONLINE_JUDGE
#define todo(...) static_assert(false)
#else
#define todo(...)
#endif
// clang-format on

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll h, w, n;
    inp(h, w, n);
    using P = pair<ll, ll>;
    using PP = pair<P, P>;
    vector<PP> vp(n);

    int acc = 0;
    map<P, int> mp;
    mp[{1, 1}] = acc++;
    mp[{h, w}] = acc++;

    struct edge {
        int to;
        ll cost;
        edge(int to, ll cost) : to(to), cost(cost) {}
    };
    rep(i, n) {
        ll a, b, c, d;
        inp(a, b, c, d);
        if (!mp.contains({a, b})) mp[{a, b}] = acc++;
        if (!mp.contains({c, d})) mp[{c, d}] = acc++;
        vp[i] = {{a, b}, {c, d}};
    }
    vector<vector<edge>> G(acc);
    rep(i, n) {
        auto [a, b] = vp[i].first;
        auto [c, d] = vp[i].second;
        G[mp[{a, b}]].emplace_back(mp[{c, d}], 1);
    }

    for (auto [p1, i] : mp) {
        for (auto [p2, j] : mp) {
            if (i == j) continue;
            auto [x1, y1] = p1;
            auto [x2, y2] = p2;
            ll d = abs(x1 - x2) + abs(y1 - y2);
            G[i].emplace_back(j, d);
            G[j].emplace_back(i, d);
        }
    }

    auto dijkstra = [&](int ip) {
        using P = pair<ll, int>;
        priority_queue<P, vector<P>, greater<P>> pq;
        vector<ll> dist(G.size(), linf);
        dist.at(ip) = 0;
        pq.emplace(0ll, ip);
        while (!pq.empty()) {
            auto u = pq.top();
            auto [curDist, curPos] = u;
            pq.pop();
            if (curDist > dist.at(curPos)) continue;
            for (const auto& eg : G.at(curPos)) {
                if (dist.at(eg.to) > dist.at(curPos) + eg.cost) {
                    dist.at(eg.to) = dist.at(curPos) + eg.cost;
                    pq.emplace(dist.at(eg.to), eg.to);
                }
            }
        }
        return dist;
    };

    auto dist = dijkstra(mp[{1, 1}]);

    oup(dist.at(mp[{h, w}]));
    return 0;
}
0