結果
問題 | No.1065 電柱 / Pole (Easy) |
ユーザー | kiyoshi0205 |
提出日時 | 2020-05-29 21:39:54 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 304 ms / 2,000 ms |
コード長 | 4,074 bytes |
コンパイル時間 | 2,950 ms |
コンパイル使用メモリ | 201,000 KB |
実行使用メモリ | 41,336 KB |
最終ジャッジ日時 | 2024-04-27 03:13:48 |
合計ジャッジ時間 | 10,258 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 105 ms
17,552 KB |
testcase_03 | AC | 204 ms
39,760 KB |
testcase_04 | AC | 242 ms
38,072 KB |
testcase_05 | AC | 163 ms
41,336 KB |
testcase_06 | AC | 168 ms
40,192 KB |
testcase_07 | AC | 43 ms
10,368 KB |
testcase_08 | AC | 155 ms
29,688 KB |
testcase_09 | AC | 16 ms
6,944 KB |
testcase_10 | AC | 71 ms
15,104 KB |
testcase_11 | AC | 49 ms
11,648 KB |
testcase_12 | AC | 27 ms
11,952 KB |
testcase_13 | AC | 144 ms
28,796 KB |
testcase_14 | AC | 144 ms
29,260 KB |
testcase_15 | AC | 185 ms
32,108 KB |
testcase_16 | AC | 77 ms
19,620 KB |
testcase_17 | AC | 226 ms
33,992 KB |
testcase_18 | AC | 63 ms
20,952 KB |
testcase_19 | AC | 178 ms
28,584 KB |
testcase_20 | AC | 58 ms
11,480 KB |
testcase_21 | AC | 86 ms
25,528 KB |
testcase_22 | AC | 174 ms
30,744 KB |
testcase_23 | AC | 4 ms
6,944 KB |
testcase_24 | AC | 3 ms
6,940 KB |
testcase_25 | AC | 25 ms
11,588 KB |
testcase_26 | AC | 82 ms
17,944 KB |
testcase_27 | AC | 84 ms
21,360 KB |
testcase_28 | AC | 145 ms
31,908 KB |
testcase_29 | AC | 24 ms
9,776 KB |
testcase_30 | AC | 149 ms
31,580 KB |
testcase_31 | AC | 135 ms
23,944 KB |
testcase_32 | AC | 60 ms
14,800 KB |
testcase_33 | AC | 184 ms
31,720 KB |
testcase_34 | AC | 72 ms
17,816 KB |
testcase_35 | AC | 143 ms
32,716 KB |
testcase_36 | AC | 3 ms
6,940 KB |
testcase_37 | AC | 3 ms
6,940 KB |
testcase_38 | AC | 3 ms
6,940 KB |
testcase_39 | AC | 3 ms
6,940 KB |
testcase_40 | AC | 2 ms
6,940 KB |
testcase_41 | AC | 304 ms
31,092 KB |
testcase_42 | AC | 73 ms
11,904 KB |
testcase_43 | AC | 129 ms
18,048 KB |
testcase_44 | AC | 34 ms
8,960 KB |
testcase_45 | AC | 142 ms
17,888 KB |
testcase_46 | AC | 1 ms
6,944 KB |
testcase_47 | AC | 2 ms
6,948 KB |
ソースコード
#pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> // #include<ext/pb_ds/assoc_container.hpp> // #include<ext/pb_ds/tree_policy.hpp> // #include<ext/pb_ds/tag_and_trait.hpp> // using namespace __gnu_pbds; // #include<boost/multiprecision/cpp_int.hpp> // namespace multiprecisioninteger = boost::multiprecision; // using cint=multiprecisioninteger::cpp_int; using namespace std; using ll=long long; #define double long double using datas=pair<ll,ll>; using ddatas=pair<double,double>; using tdata=pair<ll,datas>; using vec=vector<ll>; using mat=vector<vec>; using pvec=vector<datas>; using pmat=vector<pvec>; // using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>; #define For(i,a,b) for(i=a;i<(ll)b;++i) #define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i) #define rep(i,N) For(i,0,N) #define rep1(i,N) For(i,1,N) #define brep(i,N) bFor(i,N,0) #define brep1(i,N) bFor(i,N,1) #define all(v) (v).begin(),(v).end() #define allr(v) (v).rbegin(),(v).rend() #define vsort(v) sort(all(v)) #define vrsort(v) sort(allr(v)) #define endl "\n" #define eb emplace_back #define print(v) cout<<v<<endl #define printyes cout<<"Yes"<<endl #define printno cout<<"No"<<endl #define printYES cout<<"YES"<<endl #define printNO cout<<"NO"<<endl #define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0) #define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0) const ll mod=1000000007; // const ll mod=998244353; const ll inf=1LL<<60; const double PI = acos(-1); const double eps = 1e-9; template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} void startupcpp(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(15); } double distance(ddatas x,ddatas y){ double a=x.first-y.first,b=x.second-y.second; return sqrt(a*a+b*b); } ll modinv(ll a) { ll b=mod,u=1,v=0,t; while(b){ t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return (u+mod)%mod; } ll moddevide(ll a,ll b){return (a*modinv(b))%mod;} vec modncrlistp,modncrlistm; ll modncr(ll n,ll r){ if(n<r)return 0; ll i,size=modncrlistp.size(); if(size<=n){ modncrlistp.resize(n+1); modncrlistm.resize(n+1); if(!size){ modncrlistp[0]=modncrlistm[0]=1; size++; } For(i,size,n+1){ modncrlistp[i]=modncrlistp[i-1]*i%mod; modncrlistm[i]=modinv(modncrlistp[i]); } } return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod; } ll modpow(ll a,ll n){ ll res=1; while(n>0){ if(n&1)res=res*a%mod; a=a*a%mod; n>>=1; } return res; } ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);} ll lcm(ll a,ll b){return a/gcd(a,b)*b;} ll countdigits(ll n){ ll ans=0; while(n){n/=10;ans++;} return ans; } ll sumdigits(ll n){ ll ans=0; while(n){ans+=n%10;n/=10;} return ans; } void topcoder(vector<int>& v){ string s; while(1){ cin>>s; int i=s[0]=='{',x=0; while(s[i]>='0'&&s[i]<='9'){ x=x*10+s[i]-'0'; ++i; } v.eb(x); if(s[i]=='}')break; } } void topcoder(string& s){ string t; cin>>t; int i=1; while(t[i]!='"'){ s+=t[i++]; } } using P=pair<double,int>; int main(){ startupcpp(); // int codeforces;cin>>codeforces;while(codeforces--){ int i,j,N,M,st,en; cin>>N>>M>>st>>en;--st;--en; vector<pair<double,double>> v(N); rep(i,N)cin>>v[i].first>>v[i].second; vector<vector<P>> g(N); while(M--){ cin>>i>>j; --i;--j; g[i].eb(distance(v[i],v[j]),j); g[j].eb(distance(v[i],v[j]),i); } priority_queue<P,vector<pair<double,int>>,greater<pair<double,int>>> que; que.push(P(0,st)); vector<bool> ch(N,false); while(!que.empty()){ auto x=que.top();que.pop(); if(x.second==en){ print(x.first); return 0; } if(ch[x.second])continue; ch[x.second]=true; for(auto next:g[x.second]){ next.first+=x.first; que.push(next); } } }