結果
問題 | No.2376 障害物競プロ |
ユーザー |
👑 ![]() |
提出日時 | 2023-07-09 01:02:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 468 ms / 4,000 ms |
コード長 | 2,828 bytes |
コンパイル時間 | 1,968 ms |
コンパイル使用メモリ | 205,224 KB |
最終ジャッジ日時 | 2025-02-15 09:14:00 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 40 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)a;i<(int)b;i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){int N,M;cin>>N>>M;struct point{ll x;ll y;};auto f=[&](point a,point b,point c,point d)->bool{ll A=a.y-b.y;ll B=b.x-a.x;ll C=-(a.x*A+a.y*B);ll tmp=1;tmp*=(A*c.x+B*c.y+C);tmp*=(A*d.x+B*d.y+C);return tmp>=0;};auto g=[&](point a,point b,point c,point d)->bool{return f(a,b,c,d)|f(c,d,a,b);};auto hoj=[&](ll a)->ll{return a*a;};auto dist=[&](point a,point b)->ld{return sqrtl(hoj(a.x-b.x)+hoj(a.y-b.y));};vector<point> p(N*2);rep(i,0,N) rep(j,0,2){int ind=i+j*N;cin>>p[ind].x>>p[ind].y;}vector G(N*2,vector<ld>(N*2,INF));rep(i,0,N*2) G[i][i]=0;rep(i,0,N*2) rep(j,i+1,N*2){bool ok=1;rep(k,0,N){if(!g(p[i],p[j],p[k],p[k+N])) ok=0;}if(ok){//cout<<i<<" "<<j<<" "<<dist(p[i],p[j])<<endl;G[i][j]=dist(p[i],p[j]);G[j][i]=dist(p[j],p[i]);}}rep(k,0,N*2) rep(j,0,N*2) rep(i,0,N*2){chmin(G[i][j],G[i][k]+G[k][j]);}rep(i,0,M){int a,b,c,d;cin>>a>>b>>c>>d;a--,b--,c--,d--;a+=N*b;c+=N*d;//cout<<p[a].x<<" "<<p[a].y<<" "<<p[c].x<<" "<<p[c].y<<endl;cout<<fixed<<setprecision(20)<<G[a][c]<<"\n";}}