結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | kuhaku |
提出日時 | 2020-05-29 21:44:49 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 423 ms / 2,000 ms |
コード長 | 2,883 bytes |
コンパイル時間 | 2,235 ms |
コンパイル使用メモリ | 208,416 KB |
実行使用メモリ | 37,528 KB |
最終ジャッジ日時 | 2024-04-23 21:05:44 |
合計ジャッジ時間 | 11,915 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 199 ms
18,016 KB |
testcase_03 | AC | 347 ms
37,528 KB |
testcase_04 | AC | 325 ms
37,528 KB |
testcase_05 | AC | 234 ms
37,384 KB |
testcase_06 | AC | 228 ms
37,524 KB |
testcase_07 | AC | 63 ms
10,240 KB |
testcase_08 | AC | 239 ms
29,696 KB |
testcase_09 | AC | 23 ms
5,888 KB |
testcase_10 | AC | 103 ms
14,976 KB |
testcase_11 | AC | 69 ms
11,392 KB |
testcase_12 | AC | 110 ms
14,980 KB |
testcase_13 | AC | 260 ms
27,520 KB |
testcase_14 | AC | 284 ms
28,780 KB |
testcase_15 | AC | 324 ms
31,144 KB |
testcase_16 | AC | 183 ms
23,304 KB |
testcase_17 | AC | 363 ms
33,192 KB |
testcase_18 | AC | 137 ms
20,728 KB |
testcase_19 | AC | 315 ms
31,608 KB |
testcase_20 | AC | 84 ms
11,316 KB |
testcase_21 | AC | 173 ms
23,728 KB |
testcase_22 | AC | 308 ms
29,932 KB |
testcase_23 | AC | 5 ms
5,376 KB |
testcase_24 | AC | 6 ms
5,376 KB |
testcase_25 | AC | 88 ms
14,464 KB |
testcase_26 | AC | 175 ms
19,088 KB |
testcase_27 | AC | 197 ms
20,036 KB |
testcase_28 | AC | 326 ms
31,740 KB |
testcase_29 | AC | 52 ms
9,624 KB |
testcase_30 | AC | 310 ms
35,460 KB |
testcase_31 | AC | 212 ms
23,288 KB |
testcase_32 | AC | 139 ms
16,924 KB |
testcase_33 | AC | 306 ms
30,312 KB |
testcase_34 | AC | 138 ms
16,496 KB |
testcase_35 | AC | 337 ms
32,188 KB |
testcase_36 | AC | 4 ms
5,376 KB |
testcase_37 | AC | 5 ms
5,376 KB |
testcase_38 | AC | 3 ms
5,376 KB |
testcase_39 | AC | 4 ms
5,376 KB |
testcase_40 | AC | 2 ms
5,376 KB |
testcase_41 | AC | 423 ms
30,844 KB |
testcase_42 | AC | 101 ms
12,032 KB |
testcase_43 | AC | 190 ms
18,048 KB |
testcase_44 | AC | 64 ms
8,832 KB |
testcase_45 | AC | 194 ms
17,792 KB |
testcase_46 | AC | 2 ms
5,376 KB |
testcase_47 | AC | 2 ms
5,376 KB |
ソースコード
/* confirm 0LL and 1LL confirm cornercases such as 0 confirm times of cin < 10^6 */ #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using P = pair<ll, ll>; using Pld = pair<ld, ld>; using Vec = vector<ll>; using VecP = vector<P>; using VecB = vector<bool>; using VecC = vector<char>; using VecD = vector<ld>; using VecS = vector<string>; using Graph = vector<VecP>; template <typename T> using Vec1 = vector<T>; template <typename T> using Vec2 = vector<Vec1<T> >; #define REP(i, m, n) for(ll i = (m); (i) < (n); ++(i)) #define REPN(i, m, n) for(ll i = (m); (i) <= (n); ++(i)) #define REPR(i, m, n) for(ll i = (m)-1; (i) >= (n); --(i)) #define REPNR(i, m, n) for(ll i = (m); (i) >= (n); --(i)) #define rep(i, n) REP(i, 0, n) #define repn(i, n) REPN(i, 1, n) #define repr(i, n) REPR(i, n, 0) #define repnr(i, n) REPNR(i, n, 1) #define all(s) (s).begin(), (s).end() #define pb push_back #define fs first #define sc second template <typename T> bool chmax(T &a, const T b){if(a < b){a = b; return true;} return false;} template <typename T> bool chmin(T &a, const T b){if(a > b){a = b; return true;} return false;} template <typename T> ll pow2(const T n){return (1LL << n);} template <typename T> void cosp(const T n){cout << n << ' ';} void co(void){cout << '\n';} template <typename T> void co(const T n){cout << n << '\n';} template <typename T1, typename T2> void co(pair<T1, T2> p){cout << p.fs << ' ' << p.sc << '\n';} template <typename T> void co(const Vec1<T> &v){for(T i : v) cosp(i); co();} template <typename T> void co(initializer_list<T> v){for(T i : v) cosp(i); co();} template <typename T> void ce(const T n){cerr << n << endl;} void sonic(){ios::sync_with_stdio(false); cin.tie(0);} void setp(const ll n){cout << fixed << setprecision(n);} constexpr int INF = 1e9+1; constexpr ll LINF = 1e18+1; constexpr ll MOD = 1e9+7; //constexpr ll MOD = 998244353; constexpr ld EPS = 1e-11; const ld PI = acos(-1); vector<vector<pair<ld, ll>>> graph; vector<ld> dist; void dijkstra(ll s){ using Pd = pair<ld, ll>; priority_queue<Pd, vector<Pd>, greater<Pd> > que; que.push({0, s}); while(!que.empty()){ Pd o = que.top(); que.pop(); if(o.fs >= dist[o.sc]) continue; dist[o.sc] = o.fs; for(Pd i : graph[o.sc]) que.push({o.fs+i.fs, i.sc}); } } ld getDist(ll p, ll q, VecP &pos){ return sqrt((ld)pow(pos[p].fs - pos[q].fs, 2) + pow(pos[p].sc - pos[q].sc, 2)); } int main(void){ ll n, m, x, y; cin >> n >> m >> x >> y; graph.resize(n); dist.assign(n, LINF); --x, --y; VecP pos(n); rep(i, n) cin >> pos[i].fs >> pos[i].sc; rep(i, m){ ll p, q; cin >> p >> q; --p, --q; graph[p].pb({getDist(p, q, pos), q}); graph[q].pb({getDist(p, q, pos), p}); } dijkstra(x); setp(10); co(dist[y]); return 0; }