結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | Enjapma_kyopro |
提出日時 | 2020-05-29 21:40:47 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 283 ms / 2,000 ms |
コード長 | 3,612 bytes |
コンパイル時間 | 1,523 ms |
コンパイル使用メモリ | 174,548 KB |
実行使用メモリ | 52,312 KB |
最終ジャッジ日時 | 2024-04-23 20:44:14 |
合計ジャッジ時間 | 7,694 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 6 ms
20,200 KB |
testcase_01 | AC | 7 ms
20,204 KB |
testcase_02 | AC | 122 ms
31,660 KB |
testcase_03 | AC | 173 ms
48,544 KB |
testcase_04 | AC | 175 ms
49,268 KB |
testcase_05 | AC | 132 ms
50,228 KB |
testcase_06 | AC | 125 ms
52,312 KB |
testcase_07 | AC | 41 ms
27,244 KB |
testcase_08 | AC | 153 ms
44,136 KB |
testcase_09 | AC | 19 ms
23,788 KB |
testcase_10 | AC | 62 ms
31,452 KB |
testcase_11 | AC | 47 ms
27,680 KB |
testcase_12 | AC | 28 ms
27,244 KB |
testcase_13 | AC | 120 ms
36,240 KB |
testcase_14 | AC | 159 ms
42,584 KB |
testcase_15 | AC | 174 ms
44,036 KB |
testcase_16 | AC | 76 ms
34,228 KB |
testcase_17 | AC | 203 ms
46,088 KB |
testcase_18 | AC | 58 ms
29,452 KB |
testcase_19 | AC | 196 ms
43,076 KB |
testcase_20 | AC | 48 ms
25,008 KB |
testcase_21 | AC | 69 ms
34,260 KB |
testcase_22 | AC | 173 ms
42,728 KB |
testcase_23 | AC | 7 ms
18,412 KB |
testcase_24 | AC | 7 ms
18,540 KB |
testcase_25 | AC | 28 ms
24,940 KB |
testcase_26 | AC | 88 ms
33,316 KB |
testcase_27 | AC | 97 ms
34,260 KB |
testcase_28 | AC | 168 ms
43,716 KB |
testcase_29 | AC | 23 ms
22,376 KB |
testcase_30 | AC | 191 ms
46,256 KB |
testcase_31 | AC | 130 ms
41,292 KB |
testcase_32 | AC | 80 ms
32,076 KB |
testcase_33 | AC | 179 ms
47,832 KB |
testcase_34 | AC | 57 ms
30,376 KB |
testcase_35 | AC | 164 ms
46,656 KB |
testcase_36 | AC | 8 ms
18,284 KB |
testcase_37 | AC | 8 ms
20,460 KB |
testcase_38 | AC | 6 ms
20,328 KB |
testcase_39 | AC | 9 ms
20,460 KB |
testcase_40 | AC | 7 ms
20,208 KB |
testcase_41 | AC | 283 ms
47,084 KB |
testcase_42 | AC | 65 ms
28,132 KB |
testcase_43 | AC | 121 ms
34,608 KB |
testcase_44 | AC | 42 ms
24,044 KB |
testcase_45 | AC | 116 ms
31,832 KB |
testcase_46 | AC | 6 ms
18,280 KB |
testcase_47 | AC | 6 ms
20,200 KB |
ソースコード
#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] = 9999999999.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; }