結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | yosupot |
提出日時 | 2020-05-29 21:32:51 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 196 ms / 2,000 ms |
コード長 | 5,958 bytes |
コンパイル時間 | 1,298 ms |
コンパイル使用メモリ | 129,088 KB |
実行使用メモリ | 25,564 KB |
最終ジャッジ日時 | 2024-04-23 20:21:55 |
合計ジャッジ時間 | 5,936 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 87 ms
14,592 KB |
testcase_03 | AC | 121 ms
22,860 KB |
testcase_04 | AC | 123 ms
22,360 KB |
testcase_05 | AC | 88 ms
21,632 KB |
testcase_06 | AC | 89 ms
21,824 KB |
testcase_07 | AC | 33 ms
9,216 KB |
testcase_08 | AC | 117 ms
25,120 KB |
testcase_09 | AC | 12 ms
6,940 KB |
testcase_10 | AC | 53 ms
13,056 KB |
testcase_11 | AC | 38 ms
9,984 KB |
testcase_12 | AC | 23 ms
7,040 KB |
testcase_13 | AC | 90 ms
15,232 KB |
testcase_14 | AC | 102 ms
17,476 KB |
testcase_15 | AC | 121 ms
19,912 KB |
testcase_16 | AC | 59 ms
11,812 KB |
testcase_17 | AC | 142 ms
21,112 KB |
testcase_18 | AC | 43 ms
9,472 KB |
testcase_19 | AC | 118 ms
19,892 KB |
testcase_20 | AC | 32 ms
8,320 KB |
testcase_21 | AC | 49 ms
10,752 KB |
testcase_22 | AC | 113 ms
18,468 KB |
testcase_23 | AC | 3 ms
6,940 KB |
testcase_24 | AC | 3 ms
6,944 KB |
testcase_25 | AC | 21 ms
6,944 KB |
testcase_26 | AC | 64 ms
12,716 KB |
testcase_27 | AC | 69 ms
12,776 KB |
testcase_28 | AC | 116 ms
18,576 KB |
testcase_29 | AC | 15 ms
6,944 KB |
testcase_30 | AC | 125 ms
20,144 KB |
testcase_31 | AC | 87 ms
16,420 KB |
testcase_32 | AC | 54 ms
11,324 KB |
testcase_33 | AC | 128 ms
22,044 KB |
testcase_34 | AC | 45 ms
9,608 KB |
testcase_35 | AC | 132 ms
20,712 KB |
testcase_36 | AC | 2 ms
6,940 KB |
testcase_37 | AC | 3 ms
6,940 KB |
testcase_38 | AC | 3 ms
6,944 KB |
testcase_39 | AC | 2 ms
6,944 KB |
testcase_40 | AC | 2 ms
6,940 KB |
testcase_41 | AC | 196 ms
25,564 KB |
testcase_42 | AC | 51 ms
10,368 KB |
testcase_43 | AC | 86 ms
15,232 KB |
testcase_44 | AC | 30 ms
7,808 KB |
testcase_45 | AC | 86 ms
14,976 KB |
testcase_46 | AC | 2 ms
6,944 KB |
testcase_47 | AC | 2 ms
6,940 KB |
ソースコード
//#pragma GCC optimize("Ofast") //#pragma GCC target("avx") //#undef LOCAL #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <complex> #include <cstdio> #include <cstring> #include <iostream> #include <map> #include <numeric> #include <queue> #include <set> #include <string> #include <unordered_map> #include <unordered_set> #include <vector> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); } template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; #include <unistd.h> struct Scanner { int fd = -1; char line[(1 << 15) + 1]; size_t st = 0, ed = 0; void reread() { memmove(line, line + st, ed - st); ed -= st; st = 0; ed += ::read(fd, line + ed, (1 << 15) - ed); line[ed] = '\0'; } bool succ() { while (true) { if (st == ed) { reread(); if (st == ed) return false; } while (st != ed && isspace(line[st])) st++; if (st != ed) break; } if (ed - st <= 50) { bool sep = false; for (size_t i = st; i < ed; i++) { if (isspace(line[i])) { sep = true; break; } } if (!sep) reread(); } return true; } template <class T, enable_if_t<is_same<T, string>::value, int> = 0> bool read_single(T& ref) { if (!succ()) return false; while (true) { size_t sz = 0; while (st + sz < ed && !isspace(line[st + sz])) sz++; ref.append(line + st, sz); st += sz; if (!sz || st != ed) break; reread(); } return true; } template <class T, enable_if_t<is_integral<T>::value, int> = 0> bool read_single(T& ref) { if (!succ()) return false; bool neg = false; if (line[st] == '-') { neg = true; st++; } ref = T(0); while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); } if (neg) ref = -ref; return true; } template <class T> bool read_single(V<T>& ref) { for (auto& d : ref) { if (!read_single(d)) return false; } return true; } void read() {} template <class H, class... T> void read(H& h, T&... t) { bool f = read_single(h); assert(f); read(t...); } Scanner(FILE* fp) : fd(fileno(fp)) {} }; struct Printer { public: template <bool F = false> void write() {} template <bool F = false, class H, class... T> void write(const H& h, const T&... t) { if (F) write_single(' '); write_single(h); write<true>(t...); } template <class... T> void writeln(const T&... t) { write(t...); write_single('\n'); } Printer(FILE* _fp) : fp(_fp) {} ~Printer() { flush(); } private: static constexpr size_t SIZE = 1 << 15; FILE* fp; char line[SIZE], small[50]; size_t pos = 0; void flush() { fwrite(line, 1, pos, fp); pos = 0; } void write_single(const char& val) { if (pos == SIZE) flush(); line[pos++] = val; } template <class T, enable_if_t<is_integral<T>::value, int> = 0> void write_single(T val) { if (pos > (1 << 15) - 50) flush(); if (val == 0) { write_single('0'); return; } if (val < 0) { write_single('-'); val = -val; // todo min } size_t len = 0; while (val) { small[len++] = char(0x30 | (val % 10)); val /= 10; } for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; } pos += len; } void write_single(const string& s) { for (char c : s) write_single(c); } void write_single(const char* s) { size_t len = strlen(s); for (size_t i = 0; i < len; i++) write_single(s[i]); } template <class T> void write_single(const V<T>& val) { auto n = val.size(); for (size_t i = 0; i < n; i++) { if (i) write_single(' '); write_single(val[i]); } } }; template <class D> struct MinDist { V<D> dist; V<int> from; }; template <class D, class E> MinDist<D> mindist(const VV<E>& g, int s, D inf = numeric_limits<D>::max()) { int n = (int)g.size(); V<D> dist = V<D>(n, inf); V<int> from = V<int>(n); struct P { D key; int to; bool operator<(P r) const { return key > r.key; } }; priority_queue<P> q; q.push(P{0, s}); dist[s] = D(0); while (!q.empty()) { P p = q.top(); q.pop(); if (dist[p.to] < p.key) continue; for (E e : g[p.to]) { if (p.key + e.dist < dist[e.to]) { dist[e.to] = p.key + e.dist; from[e.to] = p.to; q.push(P{dist[e.to], e.to}); } } } return MinDist<D>{dist, from}; } Scanner sc = Scanner(stdin); Printer pr = Printer(stdout); struct E { int to; double dist; }; int main() { int n, m; scanf("%d %d", &n, &m); int s, t; scanf("%d %d", &s, &t); s--; t--; V<double> x(n), y(n); for (int i = 0; i < n; i++) { scanf("%lf %lf", &(x[i]), &(y[i])); } VV<E> g(n); for (int i = 0; i < m; i++) { int a, b; scanf("%d %d", &a, &b); a--; b--; double di = hypot(abs(x[a] - x[b]), abs(y[a] - y[b])); g[a].push_back({b, di}); g[b].push_back({a, di}); } auto dist = mindist<double>(g, s); printf("%.20lf\n", dist.dist[t]); return 0; }