結果

問題 No.1065 電柱 / Pole (Easy)
ユーザー Enjapma_kyoproEnjapma_kyopro
提出日時 2020-05-29 21:39:53
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 3,610 bytes
コンパイル時間 1,726 ms
コンパイル使用メモリ 176,504 KB
実行使用メモリ 50,760 KB
最終ジャッジ日時 2023-08-06 00:11:03
合計ジャッジ時間 7,943 ms
ジャッジサーバーID
(参考情報)
judge13 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
19,936 KB
testcase_01 AC 6 ms
19,964 KB
testcase_02 AC 115 ms
34,184 KB
testcase_03 AC 165 ms
49,492 KB
testcase_04 AC 160 ms
49,860 KB
testcase_05 AC 120 ms
50,132 KB
testcase_06 AC 125 ms
50,760 KB
testcase_07 AC 41 ms
24,944 KB
testcase_08 WA -
testcase_09 AC 17 ms
21,564 KB
testcase_10 AC 66 ms
32,236 KB
testcase_11 AC 48 ms
25,632 KB
testcase_12 AC 29 ms
27,100 KB
testcase_13 AC 112 ms
36,696 KB
testcase_14 AC 136 ms
41,548 KB
testcase_15 AC 165 ms
43,240 KB
testcase_16 AC 77 ms
32,048 KB
testcase_17 AC 179 ms
45,596 KB
testcase_18 AC 54 ms
28,876 KB
testcase_19 AC 180 ms
44,568 KB
testcase_20 AC 45 ms
24,936 KB
testcase_21 AC 61 ms
31,984 KB
testcase_22 AC 152 ms
42,580 KB
testcase_23 AC 8 ms
20,208 KB
testcase_24 AC 7 ms
20,240 KB
testcase_25 AC 26 ms
26,728 KB
testcase_26 AC 86 ms
33,672 KB
testcase_27 AC 89 ms
32,132 KB
testcase_28 AC 162 ms
45,160 KB
testcase_29 AC 21 ms
24,192 KB
testcase_30 AC 169 ms
47,500 KB
testcase_31 AC 121 ms
42,324 KB
testcase_32 AC 73 ms
29,448 KB
testcase_33 AC 169 ms
46,352 KB
testcase_34 AC 58 ms
28,464 KB
testcase_35 AC 165 ms
47,160 KB
testcase_36 AC 8 ms
20,200 KB
testcase_37 AC 6 ms
20,216 KB
testcase_38 AC 7 ms
20,220 KB
testcase_39 AC 7 ms
20,244 KB
testcase_40 AC 5 ms
20,240 KB
testcase_41 AC 253 ms
47,020 KB
testcase_42 AC 67 ms
26,124 KB
testcase_43 AC 123 ms
34,616 KB
testcase_44 AC 49 ms
23,972 KB
testcase_45 AC 119 ms
34,496 KB
testcase_46 AC 7 ms
19,976 KB
testcase_47 AC 5 ms
19,928 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#include <unistd.h>
#include <sys/time.h>
#include <stdlib.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
typedef pair<P, ll> T;
typedef pair<long double , ll> Ps;
 
long long int INF = 2e18;
const ll fact_table = 3200008;
double Pi = 3.1415926535897932384626;

priority_queue <ll> pql;
priority_queue <P> pqp;
priority_queue <P> bag;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <Ps,vector<Ps>,greater<Ps> > pqps;
//small priority queue
//top pop
 
ll dx[8]={1,0,-1,0,1,1,-1,-1};
ll dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//↓,→,↑,←

#define endl "\n"
#ifdef ENJAPMA
    #undef endl
#endif
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)(); 
#define pc(x) cout << x << ",";
 
// const ll mod = 998244353ll;
const ll mod = 1000000007ll;
  
ll mypow(ll number1,ll number2, ll mod){
    if(number2 == 0){
        return 1ll;
    }else{
        ll number3 = mypow(number1,number2 / 2, mod);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
void YES(bool condition){
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

/*
ll fact[fact_table + 5],rfact[fact_table + 5]; 
 
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=fact_table; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table],mod - 2, mod);
    for(ll i=fact_table; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;}
*/

bool multicase = false;

ll n,m,num,a,b,c,d,e,h,q;
ll w, k, ans;

long double x[500005], y[500005];
vector<Ps> G[500005];
long double table[500005];


long double distance(ll a, ll b){
    long double xa = x[a], xb = x[b], ya = y[a], yb = y[b];
    return sqrt((xa-xb) * (xa-xb) + (ya-yb) * (ya-yb));
}

void solve(){
    cin >> n >> m;
    ll s, t;
    cin >> s >> t;
    for(ll i=1;i<=n;i++){
        cin >> x[i] >> y[i];
    }
    for(ll i=1;i<=m;i++){
        cin >> a >> b;
        long double cost = distance(a, b);
        G[a].pb(Ps(cost, b));
        G[b].pb(Ps(cost, a));
    }
    for(ll i=1;i<=n;i++){
        table[i] = 99999999.99;
    }
    table[s] = 0.0;
    pqps.push(Ps(0.0, s));
    while(!pqps.empty()){
        Ps p = pqps.top();
        pqps.pop();
        ll v = p.second;
        long double nowcost = p.first;
        if(nowcost > table[v])continue;
        for(int i=0;i<G[v].size();i++){
            ll nv = G[v][i].second;
            long double newcost = table[v] + G[v][i].first;
            if(table[nv] > newcost){
                table[nv] = newcost;
                pqps.push(Ps(newcost, nv));
            }
        }
    }
    long double ans = table[t];
    ps(ans);

    return;
}


int main(){
    // init();
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll q, testcase = 1;
    if(multicase){
        cin >> q;
    }else{
        q = 1; 
    }
    while(q--){
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }
    // solve();
    return 0;
}














0