結果

問題 No.2602 Real Collider
ユーザー apricity
提出日時 2024-01-12 22:56:50
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 96 ms / 2,000 ms
コード長 5,121 bytes
コンパイル時間 1,333 ms
コンパイル使用メモリ 125,560 KB
最終ジャッジ日時 2025-02-18 18:55:56
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 78
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>
#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = long double;
using LD = long double;
using P = pair<int, int>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}
template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int q; in(q);
    ll x[3],y[3];
    rep(i,3) in(x[i],y[i]);
    if(x[1] > x[2]) {
        swap(x[1],x[2]);
        swap(y[1],y[2]);
    }
    if(x[1] == x[2] and y[1] > y[2]){
        swap(x[1],x[2]);
        swap(y[1],y[2]);
    }
    if(x[0] > x[1]) {
        swap(x[0],x[1]);
        swap(y[0],y[1]);
    }
    if(x[1] == x[0] and y[0] > y[1]){
        swap(x[0],x[1]);
        swap(y[0],y[1]);
    }
    auto dist2 = [&] (int i, int j) -> ll{
        return (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
    };
    ll dx1 = x[1]-x[0];
    ll dx2 = x[2]-x[0];
    ll dy1 = y[1]-y[0];
    ll dy2 = y[2]-y[0];
    D px = 0, py = 0;
    D r2 = 0;
    if(dx1 * dy2 == dx2 * dy1){
        ll mx = 0;
        if(chmax(mx,dist2(0,1))){
            px = (x[0]+x[1])/2.0;
            py = (y[0]+y[1])/2.0;
            r2 = dist2(0,1)/4.0;
        }
        if(chmax(mx,dist2(0,2))){
            px = (x[0]+x[2])/2.0;
            py = (y[0]+y[2])/2.0;
            r2 = dist2(0,2)/4.0;
        }
        if(chmax(mx,dist2(1,2))){
            px = (x[1]+x[2])/2.0;
            py = (y[1]+y[2])/2.0;
            r2 = dist2(1,2)/4.0;
        }
    }
    else{
        ll z01 = (x[0]-x[1])*(x[0]-x[1])+(y[0]-y[1])*(y[0]-y[1]);
        ll z02 = (x[0]-x[2])*(x[0]-x[2])+(y[0]-y[2])*(y[0]-y[2]);
        ll z12 = (x[2]-x[1])*(x[2]-x[1])+(y[2]-y[1])*(y[2]-y[1]);
        if(z01 > z02 + z12){
            px = (x[0]+x[1])/2.0;
            py = (y[0]+y[1])/2.0;
            r2 = dist2(0,1)/4.0;
        }
        else if(z02 > z01 + z12){
            px = (x[0]+x[2])/2.0;
            py = (y[0]+y[2])/2.0;
            r2 = dist2(0,2)/4.0;
        }
        else if(z12 > z01 + z02){
            px = (x[1]+x[2])/2.0;
            py = (y[1]+y[2])/2.0;
            r2 = dist2(1,2)/4.0;
        }
        else{
            px = (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]);
            px /= (x[0]-x[1])*(y[0]-y[2])*2 - (x[0]-x[2])*(y[0]-y[1])*2;
            py = (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]);
            py /= (x[0]-x[1])*(y[0]-y[2])*2 - (x[0]-x[2])*(y[0]-y[1])*2;
            r2 = (px-x[0])*(px-x[0])+(py-y[0])*(py-y[0]);
        }
    }
    while(q--){
        D a,b; in(a,b);
        D e2 = (a-px)*(a-px) + (b-py)*(b-py);
        if(abs(e2-r2) < 1e-9){
            out("Yes");
        }
        else{
            if(e2-r2 > 1e-9){
                out("No");
            }
            else out("Yes");
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0