結果
問題 | No.2602 Real Collider |
ユーザー |
👑 ![]() |
提出日時 | 2024-01-12 23:27:32 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 37 ms / 2,000 ms |
コード長 | 3,083 bytes |
コンパイル時間 | 2,688 ms |
コンパイル使用メモリ | 199,656 KB |
最終ジャッジ日時 | 2025-02-18 19:11:47 |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 78 |
ソースコード
#include <bits/stdc++.h> #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,T b){if(a>b){a=b;return 1;}else return 0;} template<class T> bool chmax(T &a,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,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");} template<class T> void vec_out(vector<T> &p,int ty=0){ if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";} else{if(ty==1){cout<<p.size()<<"\n";}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){T ans=T(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(); // oddloop int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t=1; //cin>>t; rep(i,0,t) solve(); } void solve(){ ll N; cin>>N; struct po { ll x; ll y; }; vector<po> A(3); vector<po> p(N); rep(i,0,3) cin>>A[i].x>>A[i].y; rep(i,0,N) cin>>p[i].x>>p[i].y; struct poly{ ll x2; ll x1; ll y2; ll y1; ll c; }; auto calc=[&](poly a,po b) -> ll { return a.x1*b.x+a.x2*b.x*b.x+a.y1*b.y+a.y2*b.y*b.y+a.c; }; auto make_C=[&](po a,po b) -> poly { poly res; res.x2=1; res.y2=1; res.x1=-a.x-b.x; res.y1=-a.y-b.y; res.c=a.x*b.x+a.y*b.y; return res; }; rep(i,0,3){ A.push_back(A[i]); poly C=make_C(A[i],A[i+1]); if(calc(C,A[i+2])<=0){ rep(j,0,N){ yneos(calc(C,p[j])<=0); } return; } } poly l; l.x2=0; l.y2=0; l.x1=(A[0].y-A[1].y); l.y1=(A[1].x-A[0].x); l.c=-(l.x1*A[0].x+l.y1*A[0].y); ll K1=calc(l,A[2]); poly C=make_C(A[0],A[1]); ll K2=calc(C,A[2]); rep(i,0,3){ //cout<<calc(C,A[i])<<" "<<calc(l,A[i])<<endl; } if(K1<0) K1*=-1,K2*=-1; rep(i,0,N){ ll tmp=K1*calc(C,p[i])-K2*calc(l,p[i]); yneos(tmp<=0); } }