結果
| 問題 | No.2602 Real Collider |
| ユーザー |
 fastmath
|
| 提出日時 | 2024-01-12 22:08:35 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 42 ms / 2,000 ms |
| コード長 | 5,963 bytes |
| コンパイル時間 | 1,677 ms |
| コンパイル使用メモリ | 136,748 KB |
| 最終ジャッジ日時 | 2025-02-18 18:22:02 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 78 |
ソースコード
#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 doubleusing 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 upll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded downll math_mod(ll a, ll b) { return a - b * div_down(a, b); }#define tcT template<class T#define tcTU tcT, class UtcT> 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 doubleconst int mod=(1LL<<31)-1;const int cn=233811181;// intersect two linesstruct 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);#endifint 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;}}}