結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー |
|
提出日時 | 2020-05-29 22:51:04 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 438 ms / 2,000 ms |
コード長 | 1,884 bytes |
コンパイル時間 | 3,090 ms |
コンパイル使用メモリ | 208,200 KB |
最終ジャッジ日時 | 2025-01-10 18:07:48 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 46 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:8:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 8 | #define ALL(x) std::begin(x), std::end(x) | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:9:27: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 9 | #line 7 "/home/user/GitHub/competitive-programming-library/graph/dijkstra.hpp" | ~~~~~^~~~~~~~~~~~~~~~~~~~~~~ main.cpp:14:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 14 | template <class T = int64_t> | ~~~~~^~~~~~~~~~~~~~~
ソースコード
#line 1 "main.cpp" #include <bits/stdc++.h> #line 2 "/home/user/GitHub/competitive-programming-library/utils/macros.hpp" #define REP(i, n) for (int i = 0; (i) < (int)(n); ++ (i)) #define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++ (i)) #define REP_R(i, n) for (int i = (int)(n) - 1; (i) >= 0; -- (i)) #define REP3R(i, m, n) for (int i = (int)(n) - 1; (i) >= (int)(m); -- (i)) #define ALL(x) std::begin(x), std::end(x) #line 7 "/home/user/GitHub/competitive-programming-library/graph/dijkstra.hpp" /** * @brief Dijkstra ($O((E + V) \log V)$) */ template <class T = int64_t> std::vector<T> dijkstra(std::vector<std::vector<std::pair<int, T> > > const & g, int root) { std::vector<T> dist(g.size(), std::numeric_limits<T>::max()); std::priority_queue<std::pair<T, int> > que; dist[root] = 0; que.emplace(- dist[root], root); while (not que.empty()) { T dist_x; int x; std::tie(dist_x, x) = que.top(); que.pop(); if (dist[x] < - dist_x) continue; for (auto it : g[x]) { int y; T cost; std::tie(y, cost) = it; if (- dist_x + cost < dist[y]) { dist[y] = - dist_x + cost; que.emplace(dist_x - cost, y); } } } return dist; } #line 4 "main.cpp" using namespace std; int main() { int n, m; scanf("%d%d", &n, &m); int start, goal; scanf("%d%d", &start, &goal); -- start; -- goal; vector<long long> x(n), y(n); REP (i, n) { scanf("%lld%lld", &x[i], &y[i]); } vector<vector<pair<int, double> > > g(n); REP (i, m) { int p, q; cin >> p >> q; -- p; -- q; double cost = sqrt(pow(x[p] - x[q], 2) + pow(y[p] - y[q], 2)); g[p].emplace_back(q, cost); g[q].emplace_back(p, cost); } auto dist = dijkstra(g, start); printf("%.12lf\n", dist[goal]); return 0; }