結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | heno239 |
提出日時 | 2020-08-02 17:44:12 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 270 ms / 2,000 ms |
コード長 | 3,533 bytes |
コンパイル時間 | 1,387 ms |
コンパイル使用メモリ | 124,360 KB |
実行使用メモリ | 37,568 KB |
最終ジャッジ日時 | 2023-09-26 07:31:02 |
合計ジャッジ時間 | 11,149 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
7,560 KB |
testcase_01 | AC | 4 ms
7,608 KB |
testcase_02 | AC | 101 ms
20,788 KB |
testcase_03 | AC | 140 ms
36,524 KB |
testcase_04 | AC | 141 ms
37,568 KB |
testcase_05 | AC | 106 ms
36,452 KB |
testcase_06 | AC | 104 ms
35,440 KB |
testcase_07 | AC | 31 ms
13,436 KB |
testcase_08 | AC | 107 ms
31,612 KB |
testcase_09 | AC | 13 ms
9,320 KB |
testcase_10 | AC | 51 ms
18,024 KB |
testcase_11 | AC | 36 ms
14,588 KB |
testcase_12 | AC | 27 ms
14,560 KB |
testcase_13 | AC | 123 ms
24,512 KB |
testcase_14 | AC | 141 ms
28,432 KB |
testcase_15 | AC | 165 ms
30,872 KB |
testcase_16 | AC | 79 ms
20,604 KB |
testcase_17 | AC | 183 ms
33,244 KB |
testcase_18 | AC | 52 ms
17,076 KB |
testcase_19 | AC | 171 ms
31,212 KB |
testcase_20 | AC | 40 ms
13,500 KB |
testcase_21 | AC | 59 ms
20,092 KB |
testcase_22 | AC | 153 ms
30,756 KB |
testcase_23 | AC | 5 ms
7,860 KB |
testcase_24 | AC | 5 ms
7,916 KB |
testcase_25 | AC | 24 ms
13,968 KB |
testcase_26 | AC | 87 ms
21,316 KB |
testcase_27 | AC | 89 ms
21,244 KB |
testcase_28 | AC | 162 ms
32,208 KB |
testcase_29 | AC | 18 ms
11,780 KB |
testcase_30 | AC | 169 ms
34,180 KB |
testcase_31 | AC | 112 ms
27,104 KB |
testcase_32 | AC | 70 ms
19,100 KB |
testcase_33 | AC | 172 ms
34,536 KB |
testcase_34 | AC | 56 ms
16,788 KB |
testcase_35 | AC | 179 ms
34,068 KB |
testcase_36 | AC | 5 ms
7,796 KB |
testcase_37 | AC | 5 ms
7,896 KB |
testcase_38 | AC | 5 ms
7,920 KB |
testcase_39 | AC | 5 ms
7,848 KB |
testcase_40 | AC | 4 ms
7,780 KB |
testcase_41 | AC | 270 ms
33,200 KB |
testcase_42 | AC | 69 ms
15,112 KB |
testcase_43 | AC | 133 ms
21,284 KB |
testcase_44 | AC | 39 ms
12,472 KB |
testcase_45 | AC | 127 ms
20,920 KB |
testcase_46 | AC | 4 ms
7,600 KB |
testcase_47 | AC | 4 ms
7,552 KB |
ソースコード
#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<bitset> #include<stack> #include<unordered_map> #include<utility> #include<cassert> #include<complex> #include<numeric> using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; const ll INF = mod * mod; typedef pair<int, int>P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair<ll, ll> LP; typedef long double ld; typedef pair<ld, ld> LDP; const ld eps = 1e-12; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n, ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, int n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 18; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } struct edge { int to; ld cost; }; using speP = pair<ld, int>; void solve() { int n, m; cin >> n >> m; vector<vector<edge>> G(n); vector<int> x(n), y(n); int s, t; cin >> s >> t; s--; t--; rep(i, n)cin >> x[i] >> y[i]; rep(i, m) { int p, q; cin >> p >> q; p--; q--; ld dist = sqrtl(pow(x[p] - x[q], 2) + pow(y[p] - y[q], 2)); G[p].push_back({ q,dist }); G[q].push_back({ p,dist }); } vector<ld> dist(n, INF); dist[s] = 0; priority_queue<speP, vector<speP>, greater<speP>> q; q.push({ 0,s }); while (!q.empty()) { speP p = q.top(); q.pop(); int id = p.second; if (dist[id] < p.first)continue; for (edge e : G[id]) { ld nd = e.cost + dist[id]; if (nd < dist[e.to]) { dist[e.to] = nd; q.push({ nd,e.to }); } } } cout << dist[t] << "\n"; } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); //init_f(); //cout << grandy(2, 3, false, false) << "\n"; //int t; cin >> t; rep(i, t) solve(); return 0; }