結果

問題 No.2602 Real Collider
コンテスト
ユーザー asaringo
提出日時 2024-01-12 23:48:18
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,959 bytes
コンパイル時間 2,414 ms
コンパイル使用メモリ 207,952 KB
最終ジャッジ日時 2025-02-18 19:19:16
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other WA * 78
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e ...) e
#define overload5(a, b, c, d, e, f ...) f
#define overload6(a, b, c, d, e, f, g ...) g
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
typedef long long ll;
typedef long double ld;
#define chmin(a,b) a = min(a,b);
#define chmax(a,b) a = max(a,b);
#define bit_count(x) __builtin_popcountll(x)
#define leading_zero_count(x) __builtin_clz(x)
#define trailing_zero_count(x) __builtin_ctz(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)
#define rep1(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl;
#define print(...) printall(__VA_ARGS__);
#define debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(T,n,a) vector<T>(n,a)
#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))
#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))
#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))
template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}

int n;

ll d_square(ll xg, ll yg, ll gx, ll gy) {
    return (xg - gx) * (xg - gx) + (yg - gy) * (yg - gy);
}

tuple<ll,ll,ll> center(vector<ll>x, vector<ll>y){
    ll xp = (y[0] - y[1]) * (x[2] * x[2] - x[0] * x[0] + y[2] * y[2] - y[0] * y[0]) - (y[0] - y[2]) * (x[1] * x[1] - x[0] * x[0] + y[1] * y[1] - y[0] * y[0]);
    ll yp = (x[0] - x[2]) * (x[1] * x[1] - x[0] * x[0] + y[1] * y[1] - y[0] * y[0]) - (x[0] - x[1]) * (x[2] * x[2] - x[0] * x[0] + y[2] * y[2] - y[0] * y[0]);
    ll cp = (x[0] - x[1]) * (y[0] - y[2]) - (x[0] - x[2]) * (y[0] - y[1]);
    cp *= 2;
    return {xp,yp,cp};
}

void solve(){
    int q;
    cin >> q;
    vector<pair<ll,ll>> P(3);
    cin >> P;
    rep(i,3) swap(P[i].first,P[i].second);
    rep(i,3) P[i].second *= -1;
    sort(all(P),greater<pair<ll,ll>>());
    vector<ll> X(3), Y(3);
    rep(i,3){
        auto[y,x] = P[i];
        X[i] = -x;
        Y[i] = y;
    }
    auto[xg,yg,c] = center(X,Y);
    sort(all(X));
    sort(all(Y));
    if(X[0] + X[2] == X[1] * 2 && Y[0] + Y[2] == Y[1] * 2) {
        xg = X[0] + X[2];
        yg = Y[0] + Y[2];
        c = 2;
    }
    ll r_square = d_square(xg,yg,X[2]*c,Y[2]*c);
    rep(i,q){
        ll x, y;
        cin >> x >> y;
        ll dist = d_square(xg,yg,x*c,y*c);
        if(dist <= r_square) {
            pt("Yes")
        }
        else {
            pt("No")
        }
    }
}

int main(){
    fast_io
    int t = 1;
    // cin >> t;
    rep(i,t) solve();
}
0