結果

問題 No.1065 電柱 / Pole (Easy)
ユーザー ミドリムシミドリムシ
提出日時 2020-05-29 21:38:22
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 304 ms / 2,000 ms
コード長 4,657 bytes
コンパイル時間 1,635 ms
コンパイル使用メモリ 177,820 KB
実行使用メモリ 34,432 KB
最終ジャッジ日時 2024-04-23 20:36:00
合計ジャッジ時間 8,390 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 136 ms
18,944 KB
testcase_03 AC 216 ms
31,548 KB
testcase_04 AC 214 ms
31,292 KB
testcase_05 AC 182 ms
31,288 KB
testcase_06 AC 180 ms
31,416 KB
testcase_07 AC 61 ms
11,264 KB
testcase_08 AC 234 ms
33,948 KB
testcase_09 AC 21 ms
5,888 KB
testcase_10 AC 102 ms
16,896 KB
testcase_11 AC 70 ms
12,544 KB
testcase_12 AC 43 ms
10,112 KB
testcase_13 AC 142 ms
21,232 KB
testcase_14 AC 161 ms
24,660 KB
testcase_15 AC 202 ms
27,540 KB
testcase_16 AC 101 ms
15,828 KB
testcase_17 AC 215 ms
29,772 KB
testcase_18 AC 70 ms
12,288 KB
testcase_19 AC 206 ms
28,124 KB
testcase_20 AC 53 ms
10,240 KB
testcase_21 AC 82 ms
14,720 KB
testcase_22 AC 186 ms
26,072 KB
testcase_23 AC 3 ms
5,376 KB
testcase_24 AC 4 ms
5,376 KB
testcase_25 AC 41 ms
9,472 KB
testcase_26 AC 103 ms
17,824 KB
testcase_27 AC 106 ms
17,440 KB
testcase_28 AC 179 ms
26,540 KB
testcase_29 AC 23 ms
7,296 KB
testcase_30 AC 192 ms
28,784 KB
testcase_31 AC 139 ms
22,468 KB
testcase_32 AC 93 ms
15,332 KB
testcase_33 AC 194 ms
29,104 KB
testcase_34 AC 72 ms
12,924 KB
testcase_35 AC 197 ms
29,376 KB
testcase_36 AC 3 ms
5,376 KB
testcase_37 AC 4 ms
5,376 KB
testcase_38 AC 3 ms
5,376 KB
testcase_39 AC 4 ms
5,376 KB
testcase_40 AC 3 ms
5,376 KB
testcase_41 AC 304 ms
34,432 KB
testcase_42 AC 83 ms
12,928 KB
testcase_43 AC 147 ms
19,824 KB
testcase_44 AC 51 ms
9,344 KB
testcase_45 AC 150 ms
19,456 KB
testcase_46 AC 2 ms
5,376 KB
testcase_47 AC 1 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for(int i = 0; i < int(n); i++)
#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)
#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)
constexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;
inline void YES(bool condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
inline void Yes(bool condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
inline void assert_NO(bool condition){ if(!condition){ cout << "NO" << endl; exit(0); } }
inline void assert_No(bool condition){ if(!condition){ cout << "No" << endl; exit(0); } }
inline void assert_m1(bool condition){ if(!condition){ cout << -1 << endl; exit(0); } }
lint power(lint base, lint exponent, lint module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ lint root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}}; double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); } string to_string(string x){ return x; }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++) ans += to_string(*i) + " "; if(!ans.empty()) ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }
template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<lint> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } lint P(int n, int r){ if(r < 0 || n < r) return 0; return (fact[n] * inv[n - r] % mod); } lint C(int p, int q){ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };
template<class itr> bool next_sequence(itr first, itr last, int max_bound){ itr now = last; while(now != first){ now--; (*now)++; if((*now) == max_bound){ (*now) = 0; }else{ return true; } } return false; }
template<class itr, class itr2> bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2){ itr now = last; itr2 now2 = last2; while(now != first){ now--, now2--; (*now)++; if((*now) == (*now2)){ (*now) = 0; }else{ return true; } } return false; }
template<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }
inline int at(lint i, int j){ return (i >> j) & 1; }
random_device rnd;
bool is_in_board(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }

struct road{
    int to;
    double cost;
};

vector<double> dijkstra(int N, vector<vector<road>> roads, int s = 0){
    vector<double> dist(N, 1e18);
    priority_queue<pair<double, int>, vector<pair<double, int>>, greater<>> pathes;
    dist[s] = 0;
    pathes.push({0, s});
    while(!pathes.empty()){
        auto top = pathes.top();
        pathes.pop();
        int now = top.second;
        double cost = top.first;
        if(dist[now] < cost){
            continue;
        }
        for(auto i: roads[now]){
            int to = i.to;
            double cost2 = cost + i.cost;
            if(dist[to] > cost2){
                dist[to] = cost2;
                pathes.push({cost2, to});
            }
        }
    }
    return dist;
}

int main(){
    int N, M;
    cin >> N >> M;
    int X, Y;
    cin >> X >> Y;
    X--, Y--;
    position pole[N];
    rep(i, N){
        cin >> pole[i].x >> pole[i].y;
    }
    vector<vector<road>> roads(N);
    rep(i, M){
        int p, q;
        cin >> p >> q;
        p--, q--;
        roads[p].push_back({q, euclidean(pole[p], pole[q])});
        roads[q].push_back({p, euclidean(pole[p], pole[q])});
    }
    auto dist = dijkstra(N, roads, X);
    fcout << dist[Y] << endl;
    
}
0