#489359 (C++14) No.1065 電柱 / Pole (Easy)

提出ソース

結果

問題	No.1065 電柱 / Pole (Easy)
ユーザー	haruki_K
提出日時	2020-05-30 00:45:06
言語	C++14 (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	340 ms / 2,000 ms
コード長	5,035 bytes
コンパイル時間	1,948 ms
コンパイル使用メモリ	177,040 KB
実行使用メモリ	34,000 KB
最終ジャッジ日時	2023-08-06 09:06:02
合計ジャッジ時間	9,149 ms
ジャッジサーバーID （参考情報）	judge15 / judge12

このコードへのチャレンジ（β）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 4,380 KB
testcase_01	AC	1 ms 4,380 KB
testcase_02	AC	138 ms 18,724 KB
testcase_03	AC	181 ms 31,160 KB
testcase_04	AC	180 ms 34,000 KB
testcase_05	AC	131 ms 31,584 KB
testcase_06	AC	129 ms 30,924 KB
testcase_07	AC	46 ms 10,944 KB
testcase_08	AC	166 ms 32,436 KB
testcase_09	AC	16 ms 5,852 KB
testcase_10	AC	77 ms 16,152 KB
testcase_11	AC	52 ms 12,184 KB
testcase_12	AC	31 ms 10,608 KB
testcase_13	AC	152 ms 21,864 KB
testcase_14	AC	178 ms 25,200 KB
testcase_15	AC	211 ms 27,640 KB
testcase_16	AC	89 ms 16,564 KB
testcase_17	AC	222 ms 29,844 KB
testcase_18	AC	62 ms 13,296 KB
testcase_19	AC	211 ms 28,376 KB
testcase_20	AC	49 ms 10,296 KB
testcase_21	AC	70 ms 16,244 KB
testcase_22	AC	189 ms 25,408 KB
testcase_23	AC	3 ms 4,380 KB
testcase_24	AC	3 ms 4,380 KB
testcase_25	AC	28 ms 10,412 KB
testcase_26	AC	114 ms 17,444 KB
testcase_27	AC	111 ms 18,080 KB
testcase_28	AC	206 ms 27,820 KB
testcase_29	AC	19 ms 7,800 KB
testcase_30	AC	205 ms 28,504 KB
testcase_31	AC	146 ms 23,124 KB
testcase_32	AC	88 ms 15,176 KB
testcase_33	AC	203 ms 30,284 KB
testcase_34	AC	66 ms 13,436 KB
testcase_35	AC	207 ms 29,380 KB
testcase_36	AC	2 ms 4,376 KB
testcase_37	AC	3 ms 4,380 KB
testcase_38	AC	2 ms 4,376 KB
testcase_39	AC	3 ms 4,376 KB
testcase_40	AC	2 ms 4,376 KB
testcase_41	AC	340 ms 33,976 KB
testcase_42	AC	76 ms 12,800 KB
testcase_43	AC	151 ms 19,432 KB
testcase_44	AC	46 ms 9,448 KB
testcase_45	AC	148 ms 19,216 KB
testcase_46	AC	1 ms 4,380 KB
testcase_47	AC	1 ms 4,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
struct edge { int to; double cost; };
int dst(edge const& e) { return e.to; }
auto cost(edge const& e) { return e.cost; }
// >>> dijkstra
vector<double> dijkstra(vector<vector<edge> > const& g, int s) {
    vector<double> d(g.size(),-1);
    pque_min<pair<int,int> > q;
    d[s] = 0;
    q.emplace(0,s);
    while (!q.empty()) {
        auto p = q.top(); q.pop();
        const int x = p.snd;
        if (d[x] < p.fst) continue;
        for (edge const& e : g[x]) {
            const int y = dst(e);
            if (d[y] < 0 || d[y] > d[x] + cost(e)) {
                d[y] = d[x] + cost(e);
                q.emplace(d[y], y);
            }
        }
    }
    return d;
}
// <<<


int32_t main() {
    int n,m; cin >> n >> m;
    int S,T; cin >> S >> T; --S,--T;
    vector<vector<edge>> g(n);
    vector<double> x(n),y(n);
    rep (i,n) cin >> x[i] >> y[i];
    rep (i,m) {
        int P,Q; cin >> P >> Q; --P,--Q;
        double cost = hypot(x[P]-x[Q],y[P]-y[Q]);
        g[P].pb({Q,cost});
        g[Q].pb({P,cost});
    }

    auto d = dijkstra(g,S);
    cout << d[T] << endl;

}

yukicoder

結果

テストケース

ソースコード