結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | Konton7 |
提出日時 | 2020-05-29 22:43:07 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 133 ms / 2,000 ms |
コード長 | 5,391 bytes |
コンパイル時間 | 2,517 ms |
コンパイル使用メモリ | 210,728 KB |
実行使用メモリ | 17,408 KB |
最終ジャッジ日時 | 2024-04-24 00:09:04 |
合計ジャッジ時間 | 6,698 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 57 ms
10,368 KB |
testcase_03 | AC | 74 ms
14,412 KB |
testcase_04 | AC | 76 ms
14,284 KB |
testcase_05 | AC | 64 ms
14,416 KB |
testcase_06 | AC | 64 ms
14,284 KB |
testcase_07 | AC | 26 ms
7,040 KB |
testcase_08 | AC | 92 ms
17,152 KB |
testcase_09 | AC | 10 ms
5,376 KB |
testcase_10 | AC | 44 ms
9,472 KB |
testcase_11 | AC | 31 ms
7,552 KB |
testcase_12 | AC | 18 ms
5,376 KB |
testcase_13 | AC | 71 ms
9,728 KB |
testcase_14 | AC | 69 ms
11,900 KB |
testcase_15 | AC | 86 ms
13,064 KB |
testcase_16 | AC | 44 ms
6,784 KB |
testcase_17 | AC | 95 ms
13,628 KB |
testcase_18 | AC | 34 ms
5,888 KB |
testcase_19 | AC | 89 ms
13,828 KB |
testcase_20 | AC | 24 ms
6,272 KB |
testcase_21 | AC | 39 ms
6,272 KB |
testcase_22 | AC | 80 ms
12,416 KB |
testcase_23 | AC | 3 ms
5,376 KB |
testcase_24 | AC | 2 ms
5,376 KB |
testcase_25 | AC | 16 ms
5,376 KB |
testcase_26 | AC | 49 ms
8,832 KB |
testcase_27 | AC | 47 ms
8,064 KB |
testcase_28 | AC | 76 ms
11,532 KB |
testcase_29 | AC | 11 ms
5,376 KB |
testcase_30 | AC | 82 ms
13,872 KB |
testcase_31 | AC | 51 ms
11,052 KB |
testcase_32 | AC | 34 ms
8,192 KB |
testcase_33 | AC | 74 ms
13,812 KB |
testcase_34 | AC | 31 ms
6,400 KB |
testcase_35 | AC | 81 ms
13,208 KB |
testcase_36 | AC | 2 ms
5,376 KB |
testcase_37 | AC | 2 ms
5,376 KB |
testcase_38 | AC | 2 ms
5,376 KB |
testcase_39 | AC | 2 ms
5,376 KB |
testcase_40 | AC | 1 ms
5,376 KB |
testcase_41 | AC | 133 ms
17,408 KB |
testcase_42 | AC | 35 ms
7,680 KB |
testcase_43 | AC | 68 ms
10,752 KB |
testcase_44 | AC | 23 ms
6,272 KB |
testcase_45 | AC | 66 ms
10,496 KB |
testcase_46 | AC | 2 ms
5,376 KB |
testcase_47 | AC | 2 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; using VI = vector<int>; using VL = vector<ll>; using VS = vector<string>; using VB = vector<bool>; using VVI = vector<VI>; using VVL = vector<VL>; using PII = std::pair<int, int>; using PLL = std::pair<ll, ll>; using TI3 = std::tuple<int, int, int>; using TI4 = std::tuple<int, int, int, int>; using TL3 = std::tuple<ll, ll, ll>; using TL4 = std::tuple<ll, ll, ll, ll>; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define rep2(i, s, n) for (int i = (s); i < (int)(n); i++) #define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d)) #define allpt(v) (v).begin(), (v).end() #define allpt_c(v) (v).cbegin(), (v).cend() #define allpt_r(v) (v).rbegin(), (v).rend() const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9; const int mod = mod1; const ll inf = 1e18; const string wsp = " "; const string tb = "\t"; const string rt = "\n"; template <typename T> void show1dvec(const vector<T> &v) { if (v.size() == 0) return; int n = v.size() - 1; rep(i, n) cout << v[i] << wsp; cout << v[n] << rt; return; } template <typename T> void show2dvec(const vector<vector<T>> &v) { int n = v.size(); rep(i, n) show1dvec(v[i]); } template <typename T, typename S> void show1dpair(const vector<pair<T, S>> &v) { int n = v.size(); rep(i, n) cout << v[i].first << wsp << v[i].second << rt; return; } template <typename T, typename S> void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) { int n = v.size(); rep(i, n) { t.push_back(v[i].first); s.push_back(v[i].second); } return; } template <typename T> void maxvec(vector<T> &v) { T s = v[0]; int n = v.size(); rep(i, n - 1) { if (s > v[i + 1]) { v[i + 1] = s; } s = v[i + 1]; } } template <typename T, typename S> bool myfind(T t, S s) { return find(t.cbegin(), t.cend(), s) != t.cend(); } bool check(int y, int x, int h, int w) { return 0 <= y && y < h && 0 <= x && x < w; } template <typename T> vector<T> cumsum(const vector<T> &v) { T s = 0; vector<T> ret; rep(i, v.size()) { s += v[i]; s %= mod; ret.emplace_back(s); } return ret; } bool iskadomatsu(int a, int b, int c) { return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c)); } VS split(string s, char c) { VS ret; string part; s += c; rep(i, s.length()) { if (s[i] == c) { ret.emplace_back(part); part = ""; } else if (s[i] != c) { part += s[i]; } } return ret; } string removezero(string &s) { string ret; for (auto z : s) if (z != '0') ret += z; return ret; } ll sumdigit(ll x) { ll ans{0}; while (x > 0) { ans += x % 10; x /= 10; } return ans; } template <typename T, typename S, typename R> ll pow_mod(T p, S q, R mod = 1ll) { ll ret = 1, r = p; while (q) { if (q % 2) ret *= r, ret %= mod; r = (r * r) % mod, q /= 2; } return ret % mod; } void make_frac_tables(VL &frac_list, VL &frac_inv_list) { rep(i, frac_list.size() - 1) { frac_list[i + 1] *= frac_list[i] * (i + 1); frac_list[i + 1] %= mod; frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod); frac_inv_list[i + 1] %= mod; } } ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) { if (a < b) return 0; ll ret = frac_list[a]; ret *= frac_inv_list[b]; ret %= mod; ret *= frac_inv_list[a - b]; ret %= mod; return ret; } const double maxint = 1e9; vector<double> shortest; VVI connective; vector<PII> xy_list; double dist(int p, int q) { double d, dx, dy; dx = xy_list[p].first - xy_list[q].first; dy = xy_list[p].second - xy_list[q].second; d = sqrt(pow(dx, 2) + pow(dy, 2)); return d; } void djkstra(int s, int t) { vector<int> search = {s}; vector<int> new_search; fill(allpt(shortest), maxint); shortest[s] = 0; double d; while (!search.empty()) { for (auto i : search) { for (auto j : connective[i]) { d = dist(i, j); if (shortest[j] > d + shortest[i]) { shortest[j] = d + shortest[i]; new_search.emplace_back(j); } } } search.clear(); search = new_search; new_search.clear(); } printf("%.10f\n", shortest[t]); } int main() { cin.tie(0); ios::sync_with_stdio(false); #ifdef DEBUG cout << "DEBUG MODE" << endl; ifstream in("input.txt"); //for debug cin.rdbuf(in.rdbuf()); //for debug #endif int n = 0, m, a, b, s, t; cin >> n >> m >> s >> t; connective.resize(n + 1); shortest.resize(n + 1); xy_list.resize(n + 1); rep2(i, 1, n + 1) { cin >> a >> b; xy_list[i] = (make_pair(a, b)); } rep(i, m) { cin >> a >> b; connective[a].emplace_back(b); connective[b].emplace_back(a); } djkstra(s, t); return 0; }