結果

問題 No.2602 Real Collider
ユーザー asaringoasaringo
提出日時 2024-01-12 23:49:02
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,138 bytes
コンパイル時間 2,752 ms
コンパイル使用メモリ 218,704 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-28 00:27:27
合計ジャッジ時間 6,963 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 3 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 19 ms
5,376 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 17 ms
5,376 KB
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 AC 19 ms
5,376 KB
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 AC 17 ms
5,376 KB
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 AC 16 ms
5,376 KB
testcase_61 AC 12 ms
5,376 KB
testcase_62 WA -
testcase_63 WA -
testcase_64 AC 23 ms
5,376 KB
testcase_65 WA -
testcase_66 WA -
testcase_67 WA -
testcase_68 WA -
testcase_69 WA -
testcase_70 WA -
testcase_71 WA -
testcase_72 WA -
testcase_73 WA -
testcase_74 AC 18 ms
5,376 KB
testcase_75 WA -
testcase_76 WA -
testcase_77 WA -
testcase_78 AC 21 ms
5,376 KB
testcase_79 AC 18 ms
5,376 KB
testcase_80 WA -
権限があれば一括ダウンロードができます

ソースコード

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 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;}

struct Int128t {
    __int128_t x;

    Int128t() {}
    Int128t(const long long &a) { x = a; }
    Int128t(const string &s) { parse(s); }

    long long long_val() { return (long long)x; }
    __int128_t val() { return x; }
    __int128_t abs() { return x < 0 ? -x : x; }

    void set(const long long &a) { x = a; }

    void parse(const string &s) {
        x = 0;
        for ( char c : s ) {
        if ( isdigit(c) ) x = x * 10 + (c - '0');
        }
        if ( s[0] == '-' ) x *= -1;
    }

    Int128t operator+=(const Int128t &a) {
        x += a.x;
        return *this;
    }
    Int128t operator-=(const Int128t &a) {
        x -= a.x;
        return *this;
    }
    Int128t operator*=(const Int128t &a) {
        x *= a.x;
        return *this;
    }
    Int128t operator/=(const Int128t &a) {
        x /= a.x;
        return *this;
    }
    Int128t operator%=(const Int128t &a) {
        x %= a.x;
        return *this;
    }

    Int128t& operator++() {
        ++x;
        return *this;
    }

    Int128t operator++(int) {
        Int128t tmp(*this);
        ++x;
        return tmp;
    }

    Int128t& operator--() {
        --x;
        return *this;
    }

    Int128t operator--(int) {
        Int128t tmp(*this);
        --x;
        return tmp;
    }

    Int128t operator-() const { return Int128t(-x); }

    Int128t operator+(const Int128t &p) const { return Int128t(*this) += p; }

    Int128t operator-(const Int128t &p) const { return Int128t(*this) -= p; }

    Int128t operator*(const Int128t &p) const { return Int128t(*this) *= p; }

    Int128t operator/(const Int128t &p) const { return Int128t(*this) /= p; }

    Int128t operator%(const Int128t &p) const { return Int128t(*this) %= p; }

    bool operator<(const Int128t &a) const { return x < a.x; }

    bool operator>(const Int128t &a) const { return x > a.x; }

    bool operator<=(const Int128t &a) const { return x <= a.x; }

    bool operator>=(const Int128t &a) const { return x >= a.x; }

    bool operator==(const Int128t &a) const { return x == a.x; }

    bool operator!=(const Int128t &a) const { return x != a.x; }

    Int128t operator<<(const Int128t &a) const {
        return Int128t(x << a.x);
    }

    Int128t operator>>(const Int128t &a) const {
        return Int128t(x >> a.x);
    }

    Int128t& operator<<=(const Int128t &a) {
        x <<= a.x;
        return *this;
    }

    Int128t& operator>>=(const Int128t &a) {
        x >>= a.x;
        return *this;
    }
    
    friend istream &operator>>(istream &is, Int128t &x) {
        string s;
        is >> s;
        x.parse(s);
        return is;
    }

    friend ostream &operator<<(ostream &os, const Int128t &x) {
        if ( !ostream::sentry(os) ) return os;
        char buf[64];
        char *d = end(buf);
        __uint128_t tmp = (x.x < 0 ? -x.x : x.x);

        do {
            d--;
            *d = char(tmp % 10 + '0');
            tmp /= 10;
        } while ( tmp );
        if ( x.x < 0 ) {
            d--;
            *d = '-';
        }
        int len = end(buf) - d;
        if ( os.rdbuf()->sputn(d, len) != len ) { os.setstate(ios_base::badbit); }
        return os;
    }
};

using ll = Int128t;

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