結果
問題 | No.2376 障害物競プロ |
ユーザー |
|
提出日時 | 2023-07-07 23:44:26 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,494 ms / 4,000 ms |
コード長 | 7,511 bytes |
コンパイル時間 | 4,491 ms |
コンパイル使用メモリ | 248,836 KB |
実行使用メモリ | 10,752 KB |
最終ジャッジ日時 | 2024-07-21 20:08:57 |
合計ジャッジ時間 | 88,788 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 40 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>#define rep(i,b) for(int i=0;i<b;i++)#define rrep(i,b) for(int i=b-1;i>=0;i--)#define rep1(i,b) for(int i=1;i<b;i++)#define repx(i,x,b) for(int i=x;i<b;i++)#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)#define fore(i,a) for(auto& i:a)#define rng(x) (x).begin(), (x).end()#define rrng(x) (x).rbegin(), (x).rend()#define sz(x) ((int)(x).size())#define pb push_back#define fi first#define se second#define pcnt __builtin_popcountllusing namespace std;using namespace atcoder;using ll = long long;using ld = long double;template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}#define retval(x) {cout << #x << endl; return;}#define cout2(x,y) cout << x << " " << y << endl;#define coutp(p) cout << p.fi << " " << p.se << endl;#define out cout << ans << endl;#define outd cout << fixed << setprecision(20) << ans << endl;#define outm cout << ans.val() << endl;#define outv fore(yans , ans) cout << yans << "\n";#define outdv fore(yans , ans) cout << yans.val() << "\n";#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}#define coutv2(v) fore(vy , v) cout << vy << "\n";#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;using mint = modint998244353;//using mint = modint1000000007;//using mint = dynamic_modint<0>;using vm = vector<mint>;using vvm = vector<vector<mint>>;vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}#define yes {cout <<"Yes"<<endl;}#define no {cout <<"No"<<endl;}const double eps = 1e-10;const ll LINF = 1001002003004005006ll;const int INF = 1001001001;#ifdef MY_LOCAL_DEBUG#define show(x) cerr<<#x<<" = "<<x<<endl#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl#define test(x) cout << "test" << x << endl#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}#define showv2(v) fore(vy , v) cout << vy << "\n";#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";#else#define show(x)#define showp(p)#define show2(x,y)#define show3(x,y,z)#define show4(x,y,z,x2)#define test(x)#define showv(v)#define showv2(v)#define showvm(v)#define showvm2(v)#endiftypedef complex<ld> pt;ld dot(pt a, pt b) { return real(conj(a) * b); }ld cross(pt a, pt b) { return imag(conj(a) * b); }namespace std {bool operator<(const pt& lhs, const pt& rhs) {return lhs.real() == rhs.real() ? lhs.imag() < rhs.imag() : lhs.real() < rhs.real();}}struct Line {pt a, b;Line(pt a,pt b) : a(a),b(b){}};struct Circle {pt p; ld r;Circle(pt p,ld r) : p(p),r(r){}};int ccw(pt a, pt b, pt c) {b -= a; c -= a;if (cross(b, c) > eps)return 1;//counter clockwiseif (cross(b, c) < -eps)return -1;//clock wiseif (dot(b, c) < 0)return 2;//c--a--b on lineif (norm(b) < norm(c))return -2;//a--b--c on linereturn 0; //a--c--b on line}bool eq(ld a, ld b) {return abs(a - b) < eps;}//2直線の交差判定bool is_ll(Line l, Line m) {return !eq(cross(l.b - l.a, m.b - m.a), 0);}//直線と線分の交差判定bool is_ls(Line l, Line s) {return (cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);}//点が直線上に存在するかbool is_lp(Line l, pt p) {return (abs(cross(l.b - p, l.a - p)) < eps);}//点が線分上に存在するかbool is_sp(Line s, pt p) {//誤差がis_lpに比べて大きいので、できるだけis_lpを使うreturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);}//線分と線分の交差判定bool is_ss(Line s, Line t) {return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;}//点から直線への垂線の足pt proj(Line l, pt p) {ld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);return l.a + t * (l.a - l.b);}//直線と直線の交点//平行な2直線に対しては使うな!!!!pt inter_ll(Line s, Line t) {pt sv = s.b - s.a; pt tv = t.b - t.a;return s.a + sv * cross(tv, t.a - s.a) / cross(tv, sv);}//直線と点の距離ld dist_lp(Line l, pt p) {return abs(p - proj(l, p));}//円と直線の交点vector<pt> is_lc(Circle c, Line l) {vector<pt> res;ld d = dist_lp(l, c.p);if (d > c.r + eps)return res;ld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d);pt norr = (l.a - l.b) / abs(l.a - l.b);res.push_back(proj(l, c.p) + len * norr);res.push_back(proj(l, c.p) - len * norr);return res;}struct edge{int from,to;ld cost;edge(int from_=0,int to_=0,ld cost_=0) : from(from_),to(to_),cost(cost_) {}};void solve(){int n,m; cin>>n>>m;vector<vector<edge>> e(n*2);vector<pt> p(n*2);rep(i,n){rep(j,2){int a,b; cin>>a>>b;p[n*j + i] = pt(a,b);}}auto distf = [&](int i,int j)->ld{pt ptmp = p[i]-p[j];ll ret = dot(ptmp,ptmp);ld retf = sqrtl(ret);return retf;};rep(i,n) rep(ic,2){rep(j,n) rep(jc,2){Line l1(p[i+ic*n],p[j+jc*n]);bool ok = true;rep(k,n){if (k == i) continue;if (k == j) continue;Line l2(p[k],p[k+n]);if (is_ss(l1,l2)) ok = false;}if (!ok) continue;int from = i+ic*n;int to = j+jc*n;if (from==to) continue;ld cost = distf(from,to);assert(cost>0);e[i+ic*n].pb(edge(from, to, cost));}}vector<vd> dist(n*2,vd(n*2,LINF));rep(i,n*2){mpq<pair<ld,int>> q;int st = i;dist[st][st] = 0;q.push({dist[st][st] , st});while(!q.empty()){pair<ld,int> p = q.top();q.pop();ld dist_dum = p.first;int from = p.second;if (dist[st][from] < dist_dum) continue;fore(ey , e[from]){int to = ey.to;ld cost = ey.cost;if (chmin(dist[st][to] , dist_dum + cost)){q.push({dist[st][to] , to});}}}}vd ans(m);rep(i,m){vi sg(2);rep(j,2){int a,b; cin>>a>>b;a--; b--;sg[j] = a + b*n;}ans[i] = dist[sg[0]][sg[1]];assert(ans[i]<LINF-eps);}cout << fixed << setprecision(20);rep(i,m) cout << ans[i] << endl;return;}int main(){ios::sync_with_stdio(false);cin.tie(0);int t = 1;//cin>>t;rep(i,t){solve();}return 0;}