結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | penguinshunya |
提出日時 | 2020-05-29 22:04:10 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 256 ms / 2,000 ms |
コード長 | 2,520 bytes |
コンパイル時間 | 2,446 ms |
コンパイル使用メモリ | 219,076 KB |
実行使用メモリ | 24,684 KB |
最終ジャッジ日時 | 2024-11-06 04:45:45 |
合計ジャッジ時間 | 8,837 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 114 ms
12,744 KB |
testcase_03 | AC | 190 ms
24,684 KB |
testcase_04 | AC | 186 ms
24,032 KB |
testcase_05 | AC | 118 ms
23,052 KB |
testcase_06 | AC | 118 ms
24,244 KB |
testcase_07 | AC | 30 ms
8,064 KB |
testcase_08 | AC | 107 ms
20,224 KB |
testcase_09 | AC | 11 ms
6,820 KB |
testcase_10 | AC | 48 ms
11,136 KB |
testcase_11 | AC | 34 ms
8,704 KB |
testcase_12 | AC | 57 ms
9,292 KB |
testcase_13 | AC | 155 ms
18,016 KB |
testcase_14 | AC | 165 ms
18,268 KB |
testcase_15 | AC | 194 ms
19,724 KB |
testcase_16 | AC | 106 ms
14,556 KB |
testcase_17 | AC | 210 ms
22,008 KB |
testcase_18 | AC | 77 ms
12,504 KB |
testcase_19 | AC | 188 ms
20,088 KB |
testcase_20 | AC | 47 ms
8,232 KB |
testcase_21 | AC | 100 ms
15,292 KB |
testcase_22 | AC | 181 ms
19,424 KB |
testcase_23 | AC | 4 ms
6,816 KB |
testcase_24 | AC | 4 ms
6,816 KB |
testcase_25 | AC | 51 ms
8,860 KB |
testcase_26 | AC | 102 ms
12,560 KB |
testcase_27 | AC | 111 ms
12,932 KB |
testcase_28 | AC | 198 ms
20,260 KB |
testcase_29 | AC | 27 ms
6,816 KB |
testcase_30 | AC | 195 ms
20,992 KB |
testcase_31 | AC | 129 ms
14,948 KB |
testcase_32 | AC | 79 ms
11,160 KB |
testcase_33 | AC | 179 ms
20,784 KB |
testcase_34 | AC | 76 ms
10,424 KB |
testcase_35 | AC | 200 ms
20,528 KB |
testcase_36 | AC | 3 ms
6,816 KB |
testcase_37 | AC | 3 ms
6,816 KB |
testcase_38 | AC | 3 ms
6,816 KB |
testcase_39 | AC | 3 ms
6,816 KB |
testcase_40 | AC | 3 ms
6,816 KB |
testcase_41 | AC | 256 ms
21,076 KB |
testcase_42 | AC | 58 ms
8,832 KB |
testcase_43 | AC | 120 ms
12,928 KB |
testcase_44 | AC | 35 ms
6,816 KB |
testcase_45 | AC | 108 ms
12,544 KB |
testcase_46 | AC | 2 ms
6,816 KB |
testcase_47 | AC | 2 ms
6,816 KB |
ソースコード
#include <bits/stdc++.h>#define rep(i, n) for (int i = 0; i < int(n); i++)#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)#define reps(i, n) for (int i = 1; i <= int(n); i++)#define rreps(i, n) for (int i = int(n); i >= 1; i--)#define repc(i, n) for (int i = 0; i <= int(n); i++)#define rrepc(i, n) for (int i = int(n); i >= 0; i--)#define repi(i, a, b) for (int i = int(a); i < int(b); i++)#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)#define all(a) (a).begin(), (a).end()#define bit32(x) (1 << (x))#define bit64(x) (1ll << (x))#define sz(v) ((int) v.size())using namespace std;using i64 = long long;using f80 = long double;using vi32 = vector<int>;using vi64 = vector<i64>;using vf80 = vector<f80>;using vstr = vector<string>;void yes() { cout << "Yes" << endl; exit(0); }void no() { cout << "No" << endl; exit(0); }template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};template <typename T> void amax(T &x, T y) { x = max(x, y); }template <typename T> void amin(T &x, T y) { x = min(x, y); }template <typename T> T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }template <typename T> istream& operator>>(istream &is, vector<T> &v) { for (auto &x : v) is >> x; return is; }template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }const int INF = 1001001001;const int dx[] = {1, 0, -1, 0};const int dy[] = {0, 1, 0, -1};void solve() {int n, m, X, Y;cin >> n >> m >> X >> Y;X--, Y--;using P = pair<int, double>;vector<vector<P>> g(n);vi32 p(n), q(n);rep(i, n) cin >> p[i] >> q[i];rep(i, m) {int u, v;cin >> u >> v;u--, v--;double dist = sqrt(pow(p[u] - p[v], 2) + pow(q[u] - q[v], 2));g[u].emplace_back(v, dist);g[v].emplace_back(u, dist);}vector<double> dp(n, 1e18);using T = tuple<double, int>;pqasc<T> que;que.emplace(0, X);while (sz(que)) {double dist;int u;tie(dist, u) = que.top();que.pop();if (dp[u] != 1e18) continue;dp[u] = dist;for (auto pa : g[u]) {double d;int v;tie(v, d) = pa;que.emplace(dist + d, v);}}cout << dp[Y] << endl;}