結果

問題 No.2602 Real Collider
ユーザー ゆにぽけ
提出日時 2024-01-12 22:25:16
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 43 ms / 2,000 ms
コード長 3,864 bytes
コンパイル時間 1,233 ms
コンパイル使用メモリ 126,060 KB
最終ジャッジ日時 2025-02-18 18:34:19
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 78
権限があれば一括ダウンロードができます

ソースコード

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

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
template<int m> struct modint
{
private:
unsigned int value;
static constexpr int mod() {return m;}
public:
constexpr modint(const long long x = 0) noexcept
{
long long y = x;
if(y < 0 || y >= mod())
{
y %= mod();
if(y < 0) y += mod();
}
value = (unsigned int)y;
}
constexpr unsigned int val() noexcept {return value;}
constexpr modint &operator+=(const modint &other) noexcept
{
value += other.value;
if(value >= mod()) value -= mod();
return *this;
}
constexpr modint &operator-=(const modint &other) noexcept
{
unsigned int x = value;
if(x < other.value) x += mod();
x -= other.value;
value = x;
return *this;
}
constexpr modint &operator*=(const modint &other) noexcept
{
unsigned long long x = value;
x *= other.value;
value = (unsigned int) (x % mod());
return *this;
}
constexpr modint &operator/=(const modint &other) noexcept
{
return *this *= other.inverse();
}
constexpr modint inverse() const noexcept
{
assert(value);
long long a = value,b = mod(),x = 1,y = 0;
while(b)
{
long long q = a/b;
a -= q*b; swap(a,b);
x -= q*y; swap(x,y);
}
return modint(x);
}
constexpr modint power(long long N) const noexcept
{
assert(N >= 0);
modint p = *this,ret = 1;
while(N)
{
if(N & 1) ret *= p;
p *= p;
N >>= 1;
}
return ret;
}
constexpr modint operator+() {return *this;}
constexpr modint operator-() {return modint() - *this;}
constexpr modint &operator++(int) noexcept {return *this += 1;}
constexpr modint &operator--(int) noexcept {return *this -= 1;}
friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint<998244353>;
/* using mint = modint<1000000007>; */
void solve()
{
int Q;
cin >> Q;
vector<long long> X(3),Y(3);
for(int i = 0;i < 3;i++) cin >> X[i] >> Y[i];
long double cx = 0,cy = 0;
long double r2 = 1e20;
long long denom = (X[0] - X[1]) * (Y[1] - Y[2]) - (X[1] - X[2]) * (Y[0] - Y[1]);
{
for(int i = 0;i < 3;i++)
{
int j = (i + 1) % 3,k = (i + 2) % 3;
long double tx = 0.5 * (X[i] + X[j]),ty = 0.5 * (Y[i] + Y[j]);
long double s2 = (X[i] - tx) * (X[i] - tx) + (Y[i] - ty) * (Y[i] - ty);
if((X[k] - tx) * (X[k] - tx) + (Y[k] - ty) * (Y[k] - ty) <= s2)
{
if(r2 > s2)
{
cx = tx,cy = ty;
r2 = s2;
}
}
}
}
if(denom != 0)
{
long double tx = 0,ty = 0;
long double s2 = 0;
for(int i = 0;i < 3;i++)
{
tx += (X[i] * X[i] + Y[i] * Y[i]) * (Y[(i + 1) % 3] - Y[(i + 2) % 3]);
ty += (X[i] * X[i] + Y[i] * Y[i]) * (X[(i + 1) % 3] - X[(i + 2) % 3]);
}
tx /= denom * 2;
ty /= denom * (-2);
s2 = (X[0] - tx) * (X[0] - tx) + (Y[0] - ty) * (Y[0] - ty);
if(s2 < r2)
{
cx = tx,cy = ty;
r2 = s2;
}
}
for(;Q--;)
{
int x,y;
cin >> x >> y;
long double D = (cx - x) * (cx - x) + (cy - y) * (cy - y);
cout << (D <= r2 + 1e-9 ? "Yes\n":"No\n");
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int tt = 1;
/* cin >> tt; */
while(tt--) solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0