結果

問題 No.1065 電柱 / Pole (Easy)
ユーザー iiljjiiljj
提出日時 2020-05-29 22:06:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 338 ms / 2,000 ms
コード長 8,806 bytes
コンパイル時間 2,444 ms
コンパイル使用メモリ 218,592 KB
実行使用メモリ 48,176 KB
最終ジャッジ日時 2024-11-06 04:54:55
合計ジャッジ時間 9,159 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,820 KB
testcase_01 AC 2 ms
6,820 KB
testcase_02 AC 134 ms
24,756 KB
testcase_03 AC 197 ms
47,084 KB
testcase_04 AC 192 ms
45,928 KB
testcase_05 AC 139 ms
46,692 KB
testcase_06 AC 139 ms
46,972 KB
testcase_07 AC 45 ms
14,208 KB
testcase_08 AC 164 ms
43,424 KB
testcase_09 AC 16 ms
7,040 KB
testcase_10 AC 74 ms
21,376 KB
testcase_11 AC 53 ms
15,744 KB
testcase_12 AC 31 ms
16,128 KB
testcase_13 AC 153 ms
31,888 KB
testcase_14 AC 180 ms
37,956 KB
testcase_15 AC 204 ms
41,428 KB
testcase_16 AC 91 ms
24,828 KB
testcase_17 AC 217 ms
43,932 KB
testcase_18 AC 61 ms
19,500 KB
testcase_19 AC 213 ms
41,740 KB
testcase_20 AC 49 ms
13,808 KB
testcase_21 AC 72 ms
24,632 KB
testcase_22 AC 184 ms
37,808 KB
testcase_23 AC 4 ms
6,820 KB
testcase_24 AC 3 ms
6,820 KB
testcase_25 AC 29 ms
15,360 KB
testcase_26 AC 101 ms
25,060 KB
testcase_27 AC 105 ms
26,468 KB
testcase_28 AC 190 ms
43,540 KB
testcase_29 AC 20 ms
10,368 KB
testcase_30 AC 202 ms
44,076 KB
testcase_31 AC 136 ms
34,792 KB
testcase_32 AC 83 ms
21,636 KB
testcase_33 AC 209 ms
48,176 KB
testcase_34 AC 70 ms
19,388 KB
testcase_35 AC 232 ms
44,052 KB
testcase_36 AC 3 ms
6,816 KB
testcase_37 AC 4 ms
6,816 KB
testcase_38 AC 3 ms
6,820 KB
testcase_39 AC 4 ms
6,820 KB
testcase_40 AC 2 ms
6,820 KB
testcase_41 AC 338 ms
45,436 KB
testcase_42 AC 76 ms
16,512 KB
testcase_43 AC 149 ms
25,784 KB
testcase_44 AC 45 ms
11,520 KB
testcase_45 AC 131 ms
25,364 KB
testcase_46 AC 2 ms
6,820 KB
testcase_47 AC 2 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

string yes = "Yes", no = "No";
// string yes = "YES", no = "NO";
void yn(bool p) { cout << (p ? yes : no) << endl; }

/* #endregion */

/* #region Graph */

// エッジ（本来エッジは双方向だが，ここでは単方向で管理）
template <class weight_t, class flow_t> struct Edge {
    ll src;          // エッジ始点となる頂点
    ll dst;          // エッジ終点となる頂点
    weight_t weight; // 重み
    flow_t cap;
    Edge() : src(0), dst(0), weight(0) {}
    Edge(ll src, ll dst, weight_t weight) : src(src), dst(dst), weight(weight) {}
    Edge(ll src, ll dst, weight_t weight, flow_t cap) : src(src), dst(dst), weight(weight), cap(cap) {}
    // Edge 標準出力
    friend ostream &operator<<(ostream &os, Edge &edge) {
        os << "(" << edge.src << " -> " << edge.dst << ", " << edge.weight << ")";
        return os;
    }
};
// 同じ頂点を始点とするエッジ集合
template <class weight_t, class flow_t> class Node : public vc<Edge<weight_t, flow_t>> {
  public:
    ll idx;
    Node() : vc<Edge<weight_t, flow_t>>() {}
    // void add(int a, int b, weight_t w, flow_t cap) { this->emplace_back(a, b, w, cap); };
};
// graph[i] := 頂点 i を始点とするエッジ集合
template <class weight_t, class flow_t> class Graph : public vc<Node<weight_t, flow_t>> {
  public:
    Graph() : vc<Node<weight_t, flow_t>>() {}
    Graph(int n) : vc<Node<weight_t, flow_t>>(n) { REP(i, 0, n)(*this)[i].idx = i; }
    // 単方向
    void add_arc(int a, int b, weight_t w = 1, flow_t cap = 1) { (*this)[a].emplace_back(a, b, w, cap); }
    // 双方向
    void add_edge(int a, int b, weight_t w = 1, flow_t cap = 1) { add_arc(a, b, w, cap), add_arc(b, a, w, cap); }
};
// using Array = vc<Weight>;
// using Matrix = vc<Array>;

/* #endregion */

// Problem
void solve() {
    ll n, m, x, y;
    cin >> n >> m >> x >> y;
    --x, --y;
    vld p(n), q(n);
    REP(i, 0, n) cin >> p[i] >> q[i];
    vll P(m), Q(m);
    REP(i, 0, m) {
        cin >> P[i] >> Q[i];
        P[i]--, Q[i]--;
    }

    auto distance = [&](ll src, ll dst) -> ld { return hypotl(p[dst] - p[src], q[dst] - q[src]); };

    using Weight = ld;
    Graph<Weight, ll> graph(n);
    REP(i, 0, m) graph.add_edge(P[i], Q[i], distance(P[i], Q[i]));

    // dump(graph);
    // return;

    using state = pair<Weight, ll>;                       // (始点からの最短経路長, ノード番号)
    priority_queue<state, vc<state>, greater<state>> que; // 昇順に並べ替え，小さい順に取り出す
    vc<Weight> dist(n, INF);
    dist[x] = 0;
    que.emplace(0, x);
    while (que.size()) {
        // tie(d, v) = q.top();
        state cur = que.top();
        que.pop();
        Weight d = cur.first;
        ll v = cur.second;
        // dump(d, v);

        if (dist[v] < d) continue;
        for (Edge<Weight, ll> edge : graph[v])
            if (dist[v] + edge.weight < dist[edge.dst]) {
                // dump(edge.src, edge.dst, dist[edge.dst], dist[v] + edge.weight);
                dist[edge.dst] = dist[v] + edge.weight;
                que.emplace(dist[edge.dst], edge.dst);
            }
    }
    cout << dist[y] << endl;
}

// entry point
int main() {
    solve();
    return 0;
}
0