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

提出ソース

結果

問題	No.2602 Real Collider
ユーザー	fastmath
提出日時	2024-01-12 22:08:35
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	41 ms / 2,000 ms
コード長	5,963 bytes
コンパイル時間	1,426 ms
コンパイル使用メモリ	140,520 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-27 22:31:23
合計ジャッジ時間	6,275 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	41 ms 5,376 KB
testcase_11	AC	17 ms 5,376 KB
testcase_12	AC	22 ms 5,376 KB
testcase_13	AC	11 ms 5,376 KB
testcase_14	AC	23 ms 5,376 KB
testcase_15	AC	13 ms 5,376 KB
testcase_16	AC	19 ms 5,376 KB
testcase_17	AC	21 ms 5,376 KB
testcase_18	AC	15 ms 5,376 KB
testcase_19	AC	18 ms 5,376 KB
testcase_20	AC	25 ms 5,376 KB
testcase_21	AC	15 ms 5,376 KB
testcase_22	AC	17 ms 5,376 KB
testcase_23	AC	12 ms 5,376 KB
testcase_24	AC	17 ms 5,376 KB
testcase_25	AC	17 ms 5,376 KB
testcase_26	AC	12 ms 5,376 KB
testcase_27	AC	20 ms 5,376 KB
testcase_28	AC	21 ms 5,376 KB
testcase_29	AC	18 ms 5,376 KB
testcase_30	AC	19 ms 5,376 KB
testcase_31	AC	20 ms 5,376 KB
testcase_32	AC	17 ms 5,376 KB
testcase_33	AC	20 ms 5,376 KB
testcase_34	AC	20 ms 5,376 KB
testcase_35	AC	13 ms 5,376 KB
testcase_36	AC	13 ms 5,376 KB
testcase_37	AC	21 ms 5,376 KB
testcase_38	AC	22 ms 5,376 KB
testcase_39	AC	21 ms 5,376 KB
testcase_40	AC	11 ms 5,376 KB
testcase_41	AC	23 ms 5,376 KB
testcase_42	AC	19 ms 5,376 KB
testcase_43	AC	19 ms 6,940 KB
testcase_44	AC	24 ms 6,944 KB
testcase_45	AC	16 ms 6,944 KB
testcase_46	AC	15 ms 6,944 KB
testcase_47	AC	21 ms 6,940 KB
testcase_48	AC	16 ms 6,940 KB
testcase_49	AC	14 ms 6,940 KB
testcase_50	AC	11 ms 6,944 KB
testcase_51	AC	12 ms 6,944 KB
testcase_52	AC	10 ms 6,944 KB
testcase_53	AC	20 ms 6,940 KB
testcase_54	AC	16 ms 6,944 KB
testcase_55	AC	18 ms 6,944 KB
testcase_56	AC	17 ms 6,944 KB
testcase_57	AC	16 ms 6,944 KB
testcase_58	AC	7 ms 6,944 KB
testcase_59	AC	19 ms 6,940 KB
testcase_60	AC	18 ms 6,940 KB
testcase_61	AC	14 ms 6,944 KB
testcase_62	AC	20 ms 6,940 KB
testcase_63	AC	23 ms 6,940 KB
testcase_64	AC	26 ms 6,944 KB
testcase_65	AC	14 ms 6,944 KB
testcase_66	AC	21 ms 6,940 KB
testcase_67	AC	11 ms 6,940 KB
testcase_68	AC	13 ms 6,940 KB
testcase_69	AC	9 ms 6,940 KB
testcase_70	AC	10 ms 6,940 KB
testcase_71	AC	13 ms 6,944 KB
testcase_72	AC	20 ms 6,940 KB
testcase_73	AC	16 ms 6,940 KB
testcase_74	AC	20 ms 6,940 KB
testcase_75	AC	22 ms 6,940 KB
testcase_76	AC	18 ms 6,940 KB
testcase_77	AC	20 ms 6,940 KB
testcase_78	AC	24 ms 6,940 KB
testcase_79	AC	20 ms 6,940 KB
testcase_80	AC	23 ms 6,940 KB

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

ソースコード

raw source code

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
#include <array>
#include <functional>
#include <stack>
#include <memory>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define munq(a) sort(all(a)); a.resize(unique(all(a))-a.begin())
#define sz(a) ((int)a.size())

#ifdef LOCAL
#define debug(x) do { cout << #x << ": " << x << endl; } while(0)
#define debug2(x, y) do { std::cerr << #x << ", " << #y << ": " << x << ", " << y << endl; } while (0)
#define debug3(x, y, z) do {std::cerr << #x << ", " << #y << ", " << #z << ": " << x << ", " << y << ", " << z << endl; } while(0)
#else
#define debug(x)
#define debug2(x, y) 
#define debug3(x, y, z) 
#endif

#define FORI(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR(i,a) FORI(i,0,a)
#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define ROF(i,a) ROFI(i,0,a)
#define rep(a) FOR(_,a)
#define each(a,x) for (auto& a: x)
#define FORN(i, n) FORI(i, 1, n + 1)

#define ld long double

using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::pair <T, T> & data)
{
    input >> data.x >> data.y;
    return input;
}
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
tcT> vector <T> presum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    FOR (i, a.size()) {
        p[i + 1] = p[i] + a[i];
    }   
    return p;
}
tcT> vector <T> sufsum(vector <T> &a) {
    vector <T> p(a.size() + 1);
    for (int i = (int)a.size() - 1; i >= 0; --i) {
        p[i] = p[i + 1] + a[i];
    }
    return p;
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
int Bit(int mask, int bit) { return (mask >> bit) & 1; }

#define double long double

const int mod=(1LL<<31)-1;
const int cn=233811181;
// intersect two lines
struct point {
    int x, y;
    point()
    {

    }
    point(int x,int y)
    {
        this->x=x;this->y=y;
    }
    friend ll scalar(point p, point q) { return p.x * 1LL * q.x + p.y * 1LL * q.y; }

    friend ll cross(point p, point q) { return p.x * 1LL * q.y - p.y * 1LL * q.x; }

    friend istream &operator>>(istream &is, point &p) {
        is >> p.x >> p.y;
        return is;
    }
};

template<typename T>
T sqr(T t) { return t * t; }

struct line {
    double a, b;
    double c;

    line(double x, double y, double a, double b) : a(a), b(b), c(-a * x - b * y) {}
};

const double eps = 1e-9;

struct circle {
    double x, y, r;
    circle(){}
    circle(point a, point b) : x((a.x + b.x) / 2.0), y((a.y + b.y) / 2.0), r(sqrt(sqr(x - a.x) + sqr(y - a.y))) {}

    circle(point a, point b, point c) {
        line l1 = line((a.x + b.x) / 2.0, (a.y + b.y) / 2.0, b.x - a.x, b.y - a.y);
        line l2 = line((a.x + c.x) / 2.0, (a.y + c.y) / 2.0, c.x - a.x, c.y - a.y);
        x = (l1.c * l2.b - l2.c * l1.b) / (l1.b * l2.a - l2.b * l1.a);
        y = (l2.c * l1.a - l1.c * l2.a) / (l1.b * l2.a - l2.b * l1.a);
        r = sqrt(sqr(x - a.x) + sqr(y - a.y));
    }

    friend ostream &operator<<(ostream &os, const circle &c) {
        os << c.x << ' ' << c.y << '\n' << c.r << '\n';
        return os;
    }

    bool contains(point p) const {
        return sqr(p.x - x) + sqr(p.y - y) <= sqr(r) + eps;
    }
};
const int maxn=2005;
circle mem[maxn];
circle minDisk2(const vector<point> &wasps, int j, int i) {
    circle ans(wasps[i], wasps[j]);
    for (int k = 0; k < j; ++k) {
        if (ans.contains(wasps[k])) continue;
        ans = circle(wasps[k], wasps[j], wasps[i]);
    }
    return ans;
}

circle minDisk1(const vector<point> &wasps, int i) {
    circle ans(wasps[0], wasps[i]);
    for (int j = 1; j < i; ++j) {
        if (ans.contains(wasps[j])) continue;
        ans = minDisk2(wasps, j, i);
    }
    return ans;
}

circle minDisk0(const vector<point> &wasps) {
    circle ans(wasps[0], wasps[0]);
    mem[0]=ans;
    for (int i = 1; i < wasps.size(); ++i) {
        if (ans.contains(wasps[i])) {mem[i]=ans;continue;}
        ans = minDisk1(wasps, i);
        mem[i]=ans;
    }
    return ans;
}

signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n; cin >> n;
    point A, B, C;
    cin >> A.x >> A.y >> B.x >> B.y >> C.x >> C.y;
    V <point> v = {A, B, C};
    circle c = minDisk0(v);
    //cout << c.x << ' ' << c.y << endl;

    rep (n) {
        point p;cin >> p.x >> p.y;
        if (c.contains(p)) {
            cout << "Yes" << endl;
        }
        else {
            cout<<"No" << endl;
        }
    }
}

yukicoder

結果

テストケース

ソースコード