結果

問題 No.1065 電柱 / Pole (Easy)
ユーザー SumitacchanSumitacchan
提出日時 2020-05-29 21:30:54
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 218 ms / 2,000 ms
コード長 4,403 bytes
コンパイル時間 1,709 ms
コンパイル使用メモリ 176,792 KB
実行使用メモリ 25,856 KB
最終ジャッジ日時 2024-04-23 20:18:59
合計ジャッジ時間 6,583 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 86 ms
14,568 KB
testcase_03 AC 126 ms
24,852 KB
testcase_04 AC 122 ms
24,740 KB
testcase_05 AC 105 ms
25,856 KB
testcase_06 AC 105 ms
25,392 KB
testcase_07 AC 35 ms
9,216 KB
testcase_08 AC 126 ms
25,080 KB
testcase_09 AC 12 ms
6,940 KB
testcase_10 AC 57 ms
13,056 KB
testcase_11 AC 39 ms
10,112 KB
testcase_12 AC 20 ms
9,216 KB
testcase_13 AC 90 ms
17,416 KB
testcase_14 AC 107 ms
19,828 KB
testcase_15 AC 133 ms
21,656 KB
testcase_16 AC 63 ms
13,856 KB
testcase_17 AC 149 ms
23,356 KB
testcase_18 AC 44 ms
11,136 KB
testcase_19 AC 144 ms
21,904 KB
testcase_20 AC 36 ms
8,556 KB
testcase_21 AC 50 ms
13,308 KB
testcase_22 AC 125 ms
20,344 KB
testcase_23 AC 2 ms
6,940 KB
testcase_24 AC 3 ms
6,940 KB
testcase_25 AC 19 ms
8,832 KB
testcase_26 AC 67 ms
14,104 KB
testcase_27 AC 70 ms
14,600 KB
testcase_28 AC 132 ms
22,200 KB
testcase_29 AC 14 ms
6,944 KB
testcase_30 AC 135 ms
22,516 KB
testcase_31 AC 96 ms
17,412 KB
testcase_32 AC 59 ms
12,384 KB
testcase_33 AC 138 ms
24,816 KB
testcase_34 AC 47 ms
11,104 KB
testcase_35 AC 134 ms
23,040 KB
testcase_36 AC 3 ms
6,940 KB
testcase_37 AC 3 ms
6,940 KB
testcase_38 AC 2 ms
6,940 KB
testcase_39 AC 3 ms
6,940 KB
testcase_40 AC 2 ms
6,940 KB
testcase_41 AC 218 ms
25,444 KB
testcase_42 AC 54 ms
10,240 KB
testcase_43 AC 101 ms
15,104 KB
testcase_44 AC 36 ms
7,936 KB
testcase_45 AC 100 ms
14,848 KB
testcase_46 AC 1 ms
6,944 KB
testcase_47 AC 2 ms
6,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using Pdi = pair<double, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;
using Pdi = pair<double, int>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod

struct edge{int to; double cost; int id;};

class Graph
{
public:
    int N;
    vector<vector<edge>> G;

    Graph(int N): N(N){
        G = vector<vector<edge>>(N, vector<edge>(0));
    }

    void add_Directed_edge(int from, int to, double cost = 1, int id = 0){
        G[from].push_back(edge({to, cost, id}));
    }

    void add_Undirected_edge(int v1, int v2, double cost = 1, int id = 0){
        add_Directed_edge(v1, v2, cost, id);
        add_Directed_edge(v2, v1, cost, id);
    }

    vector<double> dijkstra(int s, int t){
        vector<double> d(N);
        priority_queue<Pdi, vector<Pdi>, greater<Pdi>> que;
        fill(d.begin(), d.end(), INF);
        d[s] = 0;
        que.push(Pdi(0, s));

        while(!que.empty()){
            Pdi p = que.top(); que.pop();
            int v = p.second;
            if(v == t) return d;
            if(d[v] < p.first) continue;
            REP(i, G[v].size()){
                edge e = G[v][i];
                if(d[e.to] > d[v] + e.cost){
                    d[e.to] = d[v] + e.cost;
                    que.push(Pdi(d[e.to], e.to));
                }
            }
        }
        return d;
    }

};

signed main(){

    int N, M; cin >> N >> M;
    int X, Y; cin >> X >> Y;
    X--; Y--;
    vector<double> p(N), q(N);
    REP(i, N) cin >> p[i] >> q[i];
    Graph G(N);
    REP(i, M){
        int P, Q; cin >> P >> Q;
        P--; Q--;
        double d = sqrt(pow(p[P] - p[Q], 2) + pow(q[P] - q[Q], 2));
        G.add_Undirected_edge(P, Q, d);
    }
    vector<double> dist = G.dijkstra(X, -1);
    Out(dist[Y]);

    return 0;
}
0