結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー |
![]() |
提出日時 | 2020-05-29 21:45:57 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
CE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,947 bytes |
コンパイル時間 | 2,208 ms |
コンパイル使用メモリ | 194,092 KB |
最終ジャッジ日時 | 2025-01-10 16:51:44 |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
main.cpp: In instantiation of ‘std::istream& operator>>(std::istream&, std::vector<_Tp>&) [with T = std::pair<int, int>; std::istream = std::basic_istream<char>]’: main.cpp:72:9: required from here main.cpp:42:86: error: no match for ‘operator>>’ (operand types are ‘std::istream’ {aka ‘std::basic_istream<char>’} and ‘std::pair<int, int>’) 42 | template<typename T> istream & operator>>(istream & s, vector<T> & v) { RF(e, v) { s >> e; } return s; } | ~~^~~~ In file included from /usr/include/c++/13/sstream:40, from /usr/include/c++/13/complex:45, from /usr/include/c++/13/ccomplex:39, from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127, from main.cpp:1: /usr/include/c++/13/istream:325:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(void*&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]’ 325 | operator>>(void*& __p) | ^~~~~~~~ /usr/include/c++/13/istream:325:25: note: no known conversion for argument 1 from ‘std::pair<int, int>’ to ‘void*&’ 325 | operator>>(void*& __p) | ~~~~~~~^~~ /usr/include/c++/13/istream:224:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]’ 224 | operator>>(long double& __f) | ^~~~~~~~ /usr/include/c++/13/istream:224:31: note: no known conversion for argument 1 from ‘std::pair<int, int>’ to ‘long double&’ 224 | operator>>(long double& __f) | ~~~~~~~~~~~~~^~~ /usr/include/c++/13/istream:220:7: note: candidate: ‘std::basic_istream
ソースコード
#include <bits/stdc++.h>using namespace std;using LL = long long int;#define incID(i, l, r) for(int i = (l) ; i < (r); ++i)#define decID(i, l, r) for(int i = (r) - 1; i >= (l); --i)#define incII(i, l, r) for(int i = (l) ; i <= (r); ++i)#define decII(i, l, r) for(int i = (r) ; i >= (l); --i)#define inc(i, n) incID(i, 0, n)#define dec(i, n) decID(i, 0, n)#define inc1(i, n) incII(i, 1, n)#define dec1(i, n) decII(i, 1, n)#define inID(v, l, r) ((l) <= (v) && (v) < (r))#define inII(v, l, r) ((l) <= (v) && (v) <= (r))#define PB push_back#define EB emplace_back#define MP make_pair#define MT make_tuple#define FI first#define SE second#define FR front()#define BA back()#define ALL(v) v.begin(), v.end()#define RALL(v) v.rbegin(), v.rend()auto setmin = [](auto & a, auto b) { return (b < a ? a = b, true : false); };auto setmax = [](auto & a, auto b) { return (b > a ? a = b, true : false); };auto setmineq = [](auto & a, auto b) { return (b <= a ? a = b, true : false); };auto setmaxeq = [](auto & a, auto b) { return (b >= a ? a = b, true : false); };#define SI(v) static_cast<int>(v.size())#define RF(e, v) for(auto & e: v)#define until(e) while(! (e))#define if_not(e) if(! (e))#define ef else if#define UR assert(false)#define IN(T, ...) T __VA_ARGS__; IN_(__VA_ARGS__);void IN_() { };template<typename T, typename ... U> void IN_(T & a, U & ... b) { cin >> a; IN_(b ...); };template<typename T > void OUT(T && a ) { cout << a << endl; }template<typename T, typename ... U> void OUT(T && a, U && ... b) { cout << a << " "; OUT(b ...); }// ---- ----template<typename T> istream & operator>>(istream & s, vector<T> & v) { RF(e, v) { s >> e; } return s; }template<typename T> ostream & operator<<(ostream & s, vector<T> const & v) {inc(i, SI(v)) { s << (i == 0 ? "" : " ") << v[i]; }return s;}template<typename T, typename U> istream & operator>>(istream & s, pair<T, U> & p) { return (s >> p.FI >> p.SE); }template<typename T, typename U> ostream & operator<<(ostream & s, pair<T, U> const & p) { return (s << p.FI << " " << p.SE); }template<typename T> using LPQ = priority_queue<T, vector<T>, greater<T>>;template<typename C> void dijkstra(int s, vector<vector<pair<int, C>>> const & g, vector<C> & d) {LPQ<pair<C, int>> q;d[s] = 0;q.emplace(d[s], s);while(! q.empty()) {C c = q.top().FI;int v = q.top().SE;q.pop();if(d[v] != c) { continue; }for(auto & e : g[v]) {int ev = e.FI;C ec = e.SE;if(setmin(d[ev], d[v] + ec)) { q.emplace(d[ev], ev); }}}}int main() {IN(int, n, m, x, y);x--; y--;vector<pair<int, int>> p(n);cin >> p;vector<vector<pair<int, double>>> g(n);inc(i, m) {IN(int, a, b);a--; b--;double d = hypot(p[a].FI - p[b].FI, p[a].SE - p[b].SE);g[a].EB(b, d);g[b].EB(a, d);}const double INF = 1e9;vector<double> d(n, INF);dijkstra(x, g, d);OUT(d[y]);}