結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | ei1333333 |
提出日時 | 2020-05-29 21:40:36 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 197 ms / 2,000 ms |
コード長 | 4,163 bytes |
コンパイル時間 | 2,320 ms |
コンパイル使用メモリ | 208,696 KB |
実行使用メモリ | 24,272 KB |
最終ジャッジ日時 | 2024-04-23 20:42:13 |
合計ジャッジ時間 | 6,784 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 84 ms
13,816 KB |
testcase_03 | AC | 120 ms
24,272 KB |
testcase_04 | AC | 119 ms
23,872 KB |
testcase_05 | AC | 85 ms
24,060 KB |
testcase_06 | AC | 87 ms
24,204 KB |
testcase_07 | AC | 28 ms
8,832 KB |
testcase_08 | AC | 105 ms
23,516 KB |
testcase_09 | AC | 10 ms
6,940 KB |
testcase_10 | AC | 49 ms
12,544 KB |
testcase_11 | AC | 34 ms
9,728 KB |
testcase_12 | AC | 23 ms
9,216 KB |
testcase_13 | AC | 87 ms
16,612 KB |
testcase_14 | AC | 101 ms
18,944 KB |
testcase_15 | AC | 117 ms
20,632 KB |
testcase_16 | AC | 59 ms
13,476 KB |
testcase_17 | AC | 132 ms
22,396 KB |
testcase_18 | AC | 42 ms
10,752 KB |
testcase_19 | AC | 126 ms
20,908 KB |
testcase_20 | AC | 30 ms
8,284 KB |
testcase_21 | AC | 51 ms
13,056 KB |
testcase_22 | AC | 109 ms
19,332 KB |
testcase_23 | AC | 3 ms
6,940 KB |
testcase_24 | AC | 4 ms
6,940 KB |
testcase_25 | AC | 21 ms
8,960 KB |
testcase_26 | AC | 61 ms
13,472 KB |
testcase_27 | AC | 64 ms
14,228 KB |
testcase_28 | AC | 117 ms
21,260 KB |
testcase_29 | AC | 15 ms
6,940 KB |
testcase_30 | AC | 125 ms
21,180 KB |
testcase_31 | AC | 86 ms
16,920 KB |
testcase_32 | AC | 51 ms
11,808 KB |
testcase_33 | AC | 125 ms
24,020 KB |
testcase_34 | AC | 44 ms
10,876 KB |
testcase_35 | AC | 127 ms
23,008 KB |
testcase_36 | AC | 3 ms
6,940 KB |
testcase_37 | AC | 3 ms
6,944 KB |
testcase_38 | AC | 3 ms
6,940 KB |
testcase_39 | AC | 3 ms
6,944 KB |
testcase_40 | AC | 2 ms
6,944 KB |
testcase_41 | AC | 197 ms
23,816 KB |
testcase_42 | AC | 46 ms
9,856 KB |
testcase_43 | AC | 88 ms
14,464 KB |
testcase_44 | AC | 29 ms
7,424 KB |
testcase_45 | AC | 85 ms
14,208 KB |
testcase_46 | AC | 2 ms
6,944 KB |
testcase_47 | AC | 2 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using int64 = long long; const int mod = 1e9 + 7; // const int mod = 998244353; const int64 infll = (1LL << 62) - 1; const int inf = (1 << 30) - 1; struct IoSetup { IoSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); } } iosetup; template< typename T1, typename T2 > ostream &operator<<(ostream &os, const pair< T1, T2 > &p) { os << p.first << " " << p.second; return os; } template< typename T1, typename T2 > istream &operator>>(istream &is, pair< T1, T2 > &p) { is >> p.first >> p.second; return is; } template< typename T > ostream &operator<<(ostream &os, const vector< T > &v) { for(int i = 0; i < (int) v.size(); i++) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } template< typename T > istream &operator>>(istream &is, vector< T > &v) { for(T &in : v) is >> in; return is; } template< typename T1, typename T2 > inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); } template< typename T1, typename T2 > inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); } template< typename T = int64 > vector< T > make_v(size_t a) { return vector< T >(a); } template< typename T, typename... Ts > auto make_v(size_t a, Ts... ts) { return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...)); } template< typename T, typename V > typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) { t = v; } template< typename T, typename V > typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) { for(auto &e : t) fill_v(e, v); } template< typename F > struct FixPoint : F { FixPoint(F &&f) : F(forward< F >(f)) {} template< typename... Args > decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, forward< Args >(args)...); } }; template< typename F > inline decltype(auto) MFP(F &&f) { return FixPoint< F >{forward< F >(f)}; } template< typename T = int > struct Edge { int from, to; T cost; int idx; Edge() = default; Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {} operator int() const { return to; } }; template< typename T = int > struct Graph { vector< vector< Edge< T > > > g; int es; Graph() = default; explicit Graph(int n) : g(n), es(0) {} size_t size() const { return g.size(); } void add_directed_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es++); } void add_edge(int from, int to, T cost = 1) { g[from].emplace_back(from, to, cost, es); g[to].emplace_back(to, from, cost, es++); } void read(int M, int padding = -1, bool weighted = false, bool directed = false) { for(int i = 0; i < M; i++) { int a, b; cin >> a >> b; a += padding; b += padding; T c = T(1); if(weighted) cin >> c; if(directed) add_directed_edge(a, b, c); else add_edge(a, b, c); } } }; template< typename T = int > using Edges = vector< Edge< T > >; /** * @brief Dijkstra(単一始点最短路) */ template< typename T > vector< T > dijkstra(const Graph< T > &g, int s) { const auto INF = numeric_limits< T >::max(); vector< T > dist(g.size(), INF); using Pi = pair< T, int >; priority_queue< Pi, vector< Pi >, greater<> > que; dist[s] = 0; que.emplace(dist[s], s); while(!que.empty()) { T cost; int idx; tie(cost, idx) = que.top(); que.pop(); if(dist[idx] < cost) continue; for(auto &e : g.g[idx]) { auto next_cost = cost + e.cost; if(dist[e.to] <= next_cost) continue; dist[e.to] = next_cost; que.emplace(dist[e.to], e.to); } } return dist; } int main() { int N, M; cin >> N >> M; int X, Y; cin >> X >> Y; --X, --Y; vector< int > P(N), Q(N); for(int i = 0; i < N; i++) { cin >> P[i] >> Q[i]; } Graph< double > g(N); while(M--) { int a, b; cin >> a >> b; --a, --b; g.add_edge(a, b, hypot(P[a] - P[b], Q[a] - Q[b])); } cout << dijkstra(g, X)[Y] << "\n"; }