結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | wotsushi |
提出日時 | 2020-05-29 21:46:03 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 342 ms / 2,000 ms |
コード長 | 3,780 bytes |
コンパイル時間 | 2,476 ms |
コンパイル使用メモリ | 211,016 KB |
実行使用メモリ | 25,600 KB |
最終ジャッジ日時 | 2024-04-23 21:09:43 |
合計ジャッジ時間 | 9,035 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 133 ms
14,708 KB |
testcase_03 | AC | 210 ms
24,204 KB |
testcase_04 | AC | 206 ms
24,076 KB |
testcase_05 | AC | 177 ms
24,076 KB |
testcase_06 | AC | 172 ms
24,200 KB |
testcase_07 | AC | 58 ms
9,216 KB |
testcase_08 | AC | 223 ms
24,960 KB |
testcase_09 | AC | 21 ms
5,504 KB |
testcase_10 | AC | 103 ms
13,056 KB |
testcase_11 | AC | 70 ms
9,984 KB |
testcase_12 | AC | 45 ms
8,704 KB |
testcase_13 | AC | 135 ms
16,764 KB |
testcase_14 | AC | 160 ms
19,288 KB |
testcase_15 | AC | 182 ms
21,304 KB |
testcase_16 | AC | 93 ms
13,368 KB |
testcase_17 | AC | 205 ms
22,724 KB |
testcase_18 | AC | 70 ms
10,496 KB |
testcase_19 | AC | 190 ms
21,556 KB |
testcase_20 | AC | 54 ms
8,536 KB |
testcase_21 | AC | 81 ms
12,672 KB |
testcase_22 | AC | 173 ms
20,144 KB |
testcase_23 | AC | 4 ms
5,376 KB |
testcase_24 | AC | 4 ms
5,376 KB |
testcase_25 | AC | 40 ms
8,320 KB |
testcase_26 | AC | 104 ms
13,988 KB |
testcase_27 | AC | 103 ms
14,156 KB |
testcase_28 | AC | 176 ms
21,080 KB |
testcase_29 | AC | 23 ms
6,528 KB |
testcase_30 | AC | 188 ms
22,276 KB |
testcase_31 | AC | 127 ms
17,612 KB |
testcase_32 | AC | 81 ms
12,332 KB |
testcase_33 | AC | 190 ms
22,816 KB |
testcase_34 | AC | 69 ms
10,748 KB |
testcase_35 | AC | 191 ms
22,752 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 | 2 ms
5,376 KB |
testcase_41 | AC | 342 ms
25,600 KB |
testcase_42 | AC | 80 ms
10,240 KB |
testcase_43 | AC | 154 ms
15,232 KB |
testcase_44 | AC | 53 ms
7,680 KB |
testcase_45 | AC | 150 ms
14,848 KB |
testcase_46 | AC | 2 ms
5,376 KB |
testcase_47 | AC | 2 ms
5,376 KB |
ソースコード
#pragma region template 2.4 #include <bits/stdc++.h> using namespace std; template <typename T> using pq_asc = priority_queue<T, vector<T>, greater<T>>; typedef long long ll; typedef vector<ll> vi; typedef vector<vi> vvi; typedef pair<ll, ll> ii; typedef vector<ii> vii; typedef vector<string> vs; #define REP(i, n) for (ll i = 0; i < (n); ++i) #define REP1(i, n) for (ll i = 1; i <= (n); ++i) #define FOR(i, a) for (auto &i : a) #define CH(f, x, y) x = f(x, y) #define IN(T, x) \ T x; \ cin >> x; #define AIN(T, a, n) \ vector<T> a(n); \ FOR(i, a) \ cin >> i; #define A2IN(T1, a, T2, b, n) \ vector<T1> a(n); \ vector<T2> b(n); \ REP(i, n) \ cin >> a[i] >> b[i]; #define OUT(x) cout << (x) << endl; #define FOUT(x) cout << fixed << setprecision(15) << (x) << endl; #define ALL(a) (a).begin(), (a).end() #define SORT(a) sort(ALL(a)) #define RSORT(a) \ SORT(a); \ reverse(ALL(a)) #define DUMP(x) cout << #x << " = " << (x) << endl; #define DUMPA(a) \ cout << #a << " = {"; \ JOUT(ALL(a), ", ", cout) << "}" << endl; template <typename T> ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout) { if (s != e) { os << *s; ++s; } while (s != e) { os << sep << *s; ++s; } return os; } ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout) { if (cond) { os << yes << endl; } else { os << no << endl; } return os; } template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; return os; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os << '['; JOUT(ALL(v), ", ", os) << ']'; return os; } const ll INF = 1e18; const ll MOD = 1e9 + 7; #pragma endregion template #pragma region graph 0.2 template <typename W> struct graph { using E = pair<ll, W>; ll n; ll m; bool weighted; bool directed; vector<vector<E>> e; graph() {} graph(ll n, ll m = 0, bool weighted = false, bool directed = false) : n(n), m(m), directed(directed), weighted(weighted) { e.assign(n + 1, vector<E>()); } void add(ll i, ll j, W w = 1) { e[i].push_back(E(j, w)); if (not directed) { e[j].push_back(E(i, w)); } ++m; } vector<E> &operator[](int i) { return e[i]; } }; template <typename W> istream &operator>>(istream &is, graph<W> &G) { REP(i, G.m) { ll from, to, w; is >> from >> to; if (G.weighted) { is >> w; G.add(from, to, w); } else { G.add(from, to); } --G.m; } return is; } #pragma endregion graph #pragma region dijkstra 1.0 template <typename W> vector<double> dijkstra(graph<W> &G, ll s) { using E = pair<W, ll>; vector<double> dp(G.n + 1, INF); pq_asc<E> q; q.push({0, s}); dp[s] = 0; while (!q.empty()) { auto [c, i] = q.top(); q.pop(); for (auto [j, w] : G[i]) { if (c + w < dp[j]) { dp[j] = c + w; q.push({dp[j], j}); } } } return dp; } #pragma endregion dijkstra int main() { IN(ll, N); IN(ll, M); IN(ll, X); IN(ll, Y); A2IN(ll, p, ll, q, N); A2IN(ll, P, ll, Q, M); graph<double> G(N, 0, true); REP(i, M) { G.add(P[i], Q[i], sqrt(pow(p[P[i] - 1] - p[Q[i] - 1], 2) + pow(q[P[i] - 1] - q[Q[i] - 1], 2))); } auto dp = dijkstra(G, X); FOUT(dp[Y]); }