結果

問題 No.1065 電柱 / Pole (Easy)
ユーザー r1933r1933
提出日時 2020-05-29 22:22:08
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 218 ms / 2,000 ms
コード長 5,744 bytes
コンパイル時間 2,082 ms
コンパイル使用メモリ 209,012 KB
実行使用メモリ 25,472 KB
最終ジャッジ日時 2024-04-23 23:14:26
合計ジャッジ時間 7,269 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 95 ms
14,568 KB
testcase_03 AC 133 ms
24,088 KB
testcase_04 AC 134 ms
24,068 KB
testcase_05 AC 102 ms
23,812 KB
testcase_06 AC 106 ms
23,808 KB
testcase_07 AC 36 ms
9,216 KB
testcase_08 AC 139 ms
24,960 KB
testcase_09 AC 12 ms
5,504 KB
testcase_10 AC 61 ms
13,184 KB
testcase_11 AC 41 ms
9,984 KB
testcase_12 AC 22 ms
9,088 KB
testcase_13 AC 100 ms
17,324 KB
testcase_14 AC 112 ms
19,908 KB
testcase_15 AC 129 ms
21,664 KB
testcase_16 AC 62 ms
14,112 KB
testcase_17 AC 143 ms
23,476 KB
testcase_18 AC 47 ms
11,264 KB
testcase_19 AC 138 ms
21,904 KB
testcase_20 AC 34 ms
8,560 KB
testcase_21 AC 53 ms
13,308 KB
testcase_22 AC 125 ms
20,232 KB
testcase_23 AC 3 ms
5,376 KB
testcase_24 AC 3 ms
5,376 KB
testcase_25 AC 20 ms
8,832 KB
testcase_26 AC 72 ms
14,112 KB
testcase_27 AC 72 ms
14,652 KB
testcase_28 AC 121 ms
22,328 KB
testcase_29 AC 15 ms
7,040 KB
testcase_30 AC 140 ms
22,432 KB
testcase_31 AC 96 ms
17,416 KB
testcase_32 AC 57 ms
12,384 KB
testcase_33 AC 135 ms
24,196 KB
testcase_34 AC 49 ms
11,232 KB
testcase_35 AC 138 ms
22,912 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 4 ms
5,376 KB
testcase_38 AC 3 ms
5,376 KB
testcase_39 AC 3 ms
5,376 KB
testcase_40 AC 2 ms
5,376 KB
testcase_41 AC 218 ms
25,472 KB
testcase_42 AC 56 ms
10,496 KB
testcase_43 AC 101 ms
15,232 KB
testcase_44 AC 34 ms
7,936 KB
testcase_45 AC 96 ms
15,104 KB
testcase_46 AC 2 ms
5,376 KB
testcase_47 AC 1 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
    for (auto &e: vec) {
        is >> e;
    }
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) {
        cout << " ";
    }
    output(forward<Tail>(tail)...);
}

template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e: vec) {
        os << e << delim[&e == &vec.back()];
    }
    return os;
}

template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}
// End Header }}}

// Edge {{{
template <class Weight>
struct Edge {
    size_t from, to;
    Weight weight;

    Edge() {}
    Edge(size_t from, size_t to, Weight weight = 1) :
        from(from), to(to), weight(weight)
    {}

    bool operator<(const Edge &rhs) const {
        return weight < rhs.weight;
    }

    bool operator>(const Edge &rhs) const {
        return weight > rhs.weight;
    }

    operator size_t() const {
        return to;
    }
};
// }}}

// Graph {{{
template <class Weight>
class Graph : public vector<vector<Edge<Weight>>> {
    using graph = vector<vector<Edge<Weight>>>;

public:
    Graph() {}
    Graph(const size_t V) : graph(V) {}

    void connect(size_t from, size_t to, Weight weight = 1) {
        (*this)[from].emplace_back(from, to, weight);
    }

    friend ostream& operator<<(ostream &strm, const Graph &G) {
        for (size_t v = 0; v < G.size(); ++v) {
            strm << '[' << setw(2) << v << ']';
            for (const auto &e: G[v]) {
                strm << ' ' << setw(2) << e.to;
            }
            strm << '\n';
        }
        return strm;
    }
};
// }}}

// dijkstra {{{
template <class Weight>
vector<Weight> dijkstra(const Graph<Weight> &G, const vector<size_t> &startNodes) {
    using P = pair<Weight, size_t>;
    vector<Weight> dp(G.size(), numeric_limits<Weight>::max());
    priority_queue<P, vector<P>, greater<>> pq;

    for (const auto startNode: startNodes) {
        dp[startNode] = 0;
        pq.emplace(0, startNode);
    }

    while (!pq.empty()) {
        const Weight curCost = pq.top().first;
        const size_t curNode = pq.top().second;
        pq.pop();

        if (dp[curNode] < curCost) {
            continue;
        }

        for (const auto &e: G[curNode]) {
            const Weight newCost = dp[curNode] + e.weight;
            const size_t newNode = e.to;
            if (newCost < dp[newNode]) {
                dp[newNode] = newCost;
                pq.emplace(newCost, newNode);
            }
        }
    }

    return dp;
}
// }}}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.setf(ios_base::fixed);
    cout.precision(10);
    var(size_t, N, M);
    var(size_t, X, Y);
    X--, Y--;
    vector<double> p(N), q(N);
    rep(i, 0, N) input(p[i], q[i]);
    Graph<double> G(N);
    rep(i, 0, M) {
        var(size_t, P, Q);
        P--, Q--;
        G.connect(P, Q, hypot(diff(p[P], p[Q]), diff(q[P], q[Q])));
        G.connect(Q, P, hypot(diff(p[P], p[Q]), diff(q[P], q[Q])));
    }
    const auto dist = dijkstra<double>(G, {X});
    output(dist[Y]);
    return 0;
}
0