結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | Imperi_Night |
提出日時 | 2020-05-29 21:44:27 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 337 ms / 2,000 ms |
コード長 | 4,345 bytes |
コンパイル時間 | 1,767 ms |
コンパイル使用メモリ | 147,228 KB |
実行使用メモリ | 34,360 KB |
最終ジャッジ日時 | 2024-04-23 21:04:55 |
合計ジャッジ時間 | 8,001 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 123 ms
19,128 KB |
testcase_03 | AC | 167 ms
34,360 KB |
testcase_04 | AC | 162 ms
33,844 KB |
testcase_05 | AC | 121 ms
33,844 KB |
testcase_06 | AC | 127 ms
33,720 KB |
testcase_07 | AC | 39 ms
11,392 KB |
testcase_08 | AC | 141 ms
32,736 KB |
testcase_09 | AC | 14 ms
6,144 KB |
testcase_10 | AC | 64 ms
16,640 KB |
testcase_11 | AC | 47 ms
12,544 KB |
testcase_12 | AC | 28 ms
11,008 KB |
testcase_13 | AC | 150 ms
22,504 KB |
testcase_14 | AC | 164 ms
26,296 KB |
testcase_15 | AC | 197 ms
29,020 KB |
testcase_16 | AC | 80 ms
17,808 KB |
testcase_17 | AC | 206 ms
31,152 KB |
testcase_18 | AC | 52 ms
14,044 KB |
testcase_19 | AC | 194 ms
29,652 KB |
testcase_20 | AC | 44 ms
10,492 KB |
testcase_21 | AC | 66 ms
16,972 KB |
testcase_22 | AC | 185 ms
27,652 KB |
testcase_23 | AC | 3 ms
5,376 KB |
testcase_24 | AC | 4 ms
5,376 KB |
testcase_25 | AC | 27 ms
10,624 KB |
testcase_26 | AC | 111 ms
19,088 KB |
testcase_27 | AC | 101 ms
18,844 KB |
testcase_28 | AC | 185 ms
29,040 KB |
testcase_29 | AC | 17 ms
8,192 KB |
testcase_30 | AC | 216 ms
32,168 KB |
testcase_31 | AC | 156 ms
24,980 KB |
testcase_32 | AC | 98 ms
16,592 KB |
testcase_33 | AC | 223 ms
32,348 KB |
testcase_34 | AC | 66 ms
13,908 KB |
testcase_35 | AC | 225 ms
32,136 KB |
testcase_36 | AC | 3 ms
5,376 KB |
testcase_37 | AC | 4 ms
5,376 KB |
testcase_38 | AC | 4 ms
5,376 KB |
testcase_39 | AC | 4 ms
5,376 KB |
testcase_40 | AC | 3 ms
5,376 KB |
testcase_41 | AC | 337 ms
34,048 KB |
testcase_42 | AC | 86 ms
13,056 KB |
testcase_43 | AC | 162 ms
19,812 KB |
testcase_44 | AC | 43 ms
9,600 KB |
testcase_45 | AC | 128 ms
19,352 KB |
testcase_46 | AC | 2 ms
5,376 KB |
testcase_47 | AC | 2 ms
5,376 KB |
ソースコード
#include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cctype> #include <cstdint> #include <cstdlib> #include <cmath> #include <complex> #include <chrono> #include <deque> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <memory> #include <numeric> #include <queue> #include <set> #include <stack> #include <string> #include <type_traits> #include <unordered_map> #include <vector> #include <random> #include <utility> #include <limits> #include <list> /* template start */ #define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++) #define all(i) i.begin(), i.end() #ifdef LOCAL #define debug(...) std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) #endif void debug_out(){std::cerr<<std::endl;} template<typename Head,typename... Tail> void debug_out(Head h,Tail... t){ std::cerr<<" "<<h; if(sizeof...(t)>0)std::cout<<" :"; debug_out(t...); } template <typename T1, typename T2> std::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) { return os << pa.first << " " << pa.second; } template <typename T> std::ostream& operator<<(std::ostream& os, std::vector<T> vec) { for (std::size_t i = 0; i < vec.size(); i++)os << vec[i] << (i + 1 == vec.size() ? "" : " "); return os; } 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 Num> constexpr Num mypow(Num a, long long b) { if(b==0)return 1; if (a==0)return 0; Num x = 1; while (b > 0) { if(b & 1)x*=a; a*=a; b >>= 1; } return x; } template <std::uint_fast64_t Modulus> class modint { using u64 = std::uint_fast64_t; public: u64 a; constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {} constexpr u64 &value() noexcept { return a; } constexpr const u64 &value() const noexcept { return a; } constexpr bool operator==(const modint rhs) const noexcept {return a==rhs.a;} constexpr bool operator!=(const modint rhs) const noexcept {return !(*this==rhs);} constexpr modint operator+(const modint rhs) const noexcept { return modint(*this) += rhs; } constexpr modint operator-(const modint rhs) const noexcept { return modint(*this) -= rhs; } constexpr modint operator*(const modint rhs) const noexcept { return modint(*this) *= rhs; } constexpr modint operator/(const modint rhs) const noexcept { return modint(*this) /= rhs; } constexpr modint &operator+=(const modint rhs) noexcept { a += rhs.a; if (a >= Modulus) { a -= Modulus; } return *this; } constexpr modint &operator-=(const modint rhs) noexcept { if (a < rhs.a) { a += Modulus; } a -= rhs.a; return *this; } constexpr modint &operator*=(const modint rhs) noexcept { a = a * rhs.a % Modulus; return *this; } constexpr modint &operator/=(modint rhs) noexcept { u64 exp = Modulus - 2; while (exp) { if (exp % 2) { *this *= rhs; } rhs *= rhs; exp /= 2; } return *this; } }; /* template end */ using ll = long long; int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); using Edge=std::pair<long double,ll>; ll n,m; std::cin>>n>>m; ll x,y; std::cin>>x>>y; x--;y--; using P=std::pair<long double,long double>; std::vector<P> points(n); for(auto&& e:points)std::cin>>e.first>>e.second; std::vector<std::vector<std::pair<ll,long double>>> graph(n); rep(i,0,m){ ll p,q; std::cin>>p>>q; p--;q--; long double len=std::hypot(points[p].first-points[q].first,points[p].second-points[q].second); graph[p].emplace_back(q,len); graph[q].emplace_back(p,len); } std::priority_queue<Edge,std::vector<Edge>,std::greater<Edge>> que; constexpr long double INF=1e18; std::vector<long double> d(n,INF); d[x]=0; que.emplace(0,x); while(!que.empty()){ auto now=que.top();que.pop(); ll v=now.second; if(d[v]<now.first)continue; for(const auto& e:graph[v]){ if(d[e.first]>d[v]+e.second){ d[e.first]=d[v]+e.second; que.emplace(d[e.first],e.first); } } } std::cout<<std::setprecision(10)<<std::fixed<<d[y]<<"\n"; return 0; }