#945534 (C++17) No.2602 Real Collider

提出ソース

結果

問題	No.2602 Real Collider
ユーザー	mikam
提出日時	2024-01-20 18:49:54
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	323 ms / 2,000 ms
コード長	6,453 bytes
コンパイル時間	6,744 ms
コンパイル使用メモリ	426,392 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-04-09 21:31:38
合計ジャッジ時間	19,806 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	3 ms 6,940 KB
testcase_02	AC	3 ms 6,940 KB
testcase_03	AC	3 ms 6,944 KB
testcase_04	AC	3 ms 6,940 KB
testcase_05	AC	3 ms 6,944 KB
testcase_06	AC	3 ms 6,944 KB
testcase_07	AC	2 ms 6,944 KB
testcase_08	AC	3 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	323 ms 6,944 KB
testcase_11	AC	111 ms 6,940 KB
testcase_12	AC	141 ms 6,944 KB
testcase_13	AC	68 ms 6,944 KB
testcase_14	AC	154 ms 6,944 KB
testcase_15	AC	82 ms 6,940 KB
testcase_16	AC	130 ms 6,944 KB
testcase_17	AC	148 ms 6,940 KB
testcase_18	AC	101 ms 6,944 KB
testcase_19	AC	120 ms 6,940 KB
testcase_20	AC	171 ms 6,944 KB
testcase_21	AC	97 ms 6,940 KB
testcase_22	AC	120 ms 6,940 KB
testcase_23	AC	80 ms 6,944 KB
testcase_24	AC	114 ms 6,940 KB
testcase_25	AC	122 ms 6,944 KB
testcase_26	AC	82 ms 6,940 KB
testcase_27	AC	132 ms 6,944 KB
testcase_28	AC	141 ms 6,944 KB
testcase_29	AC	116 ms 6,940 KB
testcase_30	AC	121 ms 6,944 KB
testcase_31	AC	132 ms 6,940 KB
testcase_32	AC	111 ms 6,940 KB
testcase_33	AC	127 ms 6,940 KB
testcase_34	AC	129 ms 6,944 KB
testcase_35	AC	81 ms 6,944 KB
testcase_36	AC	80 ms 6,940 KB
testcase_37	AC	138 ms 6,940 KB
testcase_38	AC	149 ms 6,940 KB
testcase_39	AC	138 ms 6,940 KB
testcase_40	AC	69 ms 6,944 KB
testcase_41	AC	162 ms 6,944 KB
testcase_42	AC	128 ms 6,940 KB
testcase_43	AC	128 ms 6,944 KB
testcase_44	AC	164 ms 6,940 KB
testcase_45	AC	100 ms 6,940 KB
testcase_46	AC	96 ms 6,940 KB
testcase_47	AC	143 ms 6,940 KB
testcase_48	AC	111 ms 6,944 KB
testcase_49	AC	94 ms 6,940 KB
testcase_50	AC	74 ms 6,944 KB
testcase_51	AC	79 ms 6,940 KB
testcase_52	AC	55 ms 6,940 KB
testcase_53	AC	128 ms 6,944 KB
testcase_54	AC	101 ms 6,944 KB
testcase_55	AC	115 ms 6,944 KB
testcase_56	AC	114 ms 6,940 KB
testcase_57	AC	104 ms 6,940 KB
testcase_58	AC	40 ms 6,940 KB
testcase_59	AC	126 ms 6,940 KB
testcase_60	AC	115 ms 6,940 KB
testcase_61	AC	87 ms 6,944 KB
testcase_62	AC	135 ms 6,944 KB
testcase_63	AC	153 ms 6,940 KB
testcase_64	AC	174 ms 6,940 KB
testcase_65	AC	84 ms 6,944 KB
testcase_66	AC	143 ms 6,940 KB
testcase_67	AC	65 ms 6,940 KB
testcase_68	AC	75 ms 6,940 KB
testcase_69	AC	55 ms 6,944 KB
testcase_70	AC	64 ms 6,940 KB
testcase_71	AC	86 ms 6,944 KB
testcase_72	AC	125 ms 6,944 KB
testcase_73	AC	102 ms 6,944 KB
testcase_74	AC	126 ms 6,940 KB
testcase_75	AC	137 ms 6,940 KB
testcase_76	AC	122 ms 6,940 KB
testcase_77	AC	128 ms 6,940 KB
testcase_78	AC	162 ms 6,940 KB
testcase_79	AC	137 ms 6,944 KB
testcase_80	AC	160 ms 6,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <atcoder/all>
using namespace atcoder;
#include <atcoder/internal_math>
using namespace internal;
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
#define pb push_back
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
using ull = unsigned long long;
using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> int print(T& a){cout << a<< '\n';return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int takao(bool takahashi){return yesno(takahashi,"Takahashi","Aoki");}
struct __m___m__ {__m___m__(){cin.tie(0);ios_base::sync_with_stdio(false);cout << fixed << setprecision(20);}} _m_m_;
int di[]={0,1,0,-1,-1,-1,1,1};
int dj[]={1,0,-1,0,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}
#pragma region //geometry
using D = long double;
using Point = complex<D>;
ostream &operator<< (ostream &os, const Point &p){os << p.real() <<" "<<p.imag();return os;}
istream &operator>> (istream &is, Point &p){D x,y;cin>>x>>y;p=Point(x,y);return is;}
const D EPS = 1e-15;
const D PI = acosl(-1);

inline bool equal(const D &a, const D &b){return fabs(a-b)<EPS;}
int sgn(const D &a){return (a<-EPS?-1:(a>EPS?1:0));}
D dot(const Point &a,const Point &b){return a.real()*b.real() + a.imag()*b.imag();}
D cross(const Point &a,const Point &b){return a.real()*b.imag() - a.imag()*b.real();}

int ccw(const Point &a,Point b,Point c){
    b -= a;
    c -= a;
    if(!equal(sgn(cross(b,c)),0))return sgn(cross(b,c));
    if(sgn(dot(b,c))==-1)return 2;
    if(norm(b)<norm(c))return -2;
    return 0;
}

struct Circle{
    Point p;
    D r;
    Circle() = default;
    Circle(Point p,D r) : p(p),r(r){}
};

bool isInCircle(const Circle &c, const Point &p) {
    D d = abs(c.p - p);
    return (equal(d, c.r) || d < c.r - EPS);
}

Circle min_circle(vector<Point> ps){
    auto c3 = [](const Point &a, const Point &b, const Point &c){
        ld A = norm(b - c);
        ld B = norm(c - a);
        ld C = norm(a - b);
        ld S = abs(cross(b - a, c - a));
        Point p = (A*(B+C-A)*a + B*(C+A-B)*b + C*(A+B-C)*c) / (4*S*S);
        ld r = abs(p - a);
        return Circle(p,r);
    };
    auto c2 = [](const Point &a, const Point &b){
        Point c = (a + b) / (ld)2;
        ld r = abs(a - c);
        return Circle(c,r);
    };

    auto in_circle = [](const Point &a, const Circle &c){
        return norm(a - c.p) <= c.r*c.r + EPS;
    };

    int n = ps.size();
    std::random_device seed_gen;
    std::mt19937 engine(seed_gen());
    shuffle(ps.begin(), ps.end(),engine);
    Circle c = c2(ps[0], ps[1]);
    for(int i = 2; i < n; ++i){
        if(!in_circle(ps[i], c)){
            c = c2(ps[0], ps[i]);
            for(int j = 1; j < i; ++j){
                if(!in_circle(ps[j], c)){
                    c = c2(ps[j], ps[i]);
                    for(int k = 0; k < j; ++k){
                        if(!in_circle(ps[k], c)){
                            c = c3(ps[i], ps[j], ps[k]);
                        }
                    }
                }
            }
        }
    }
    return c;
}
#pragma endregion //geometry
signed main() {

    INT(q);
    vector<Point> p(3);
    rep(i,3){
        INT(x,y);
        p[i] = Point(x,y);
    }
    auto c = min_circle(p);
    while(q--){
        INT(x,y);
        yesno(isInCircle(c,Point(x,y)));
    }
    return 0;
}

yukicoder

結果

テストケース

ソースコード