結果
問題 | No.2602 Real Collider |
ユーザー | noya2 |
提出日時 | 2024-01-16 22:42:36 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 892 ms / 2,000 ms |
コード長 | 5,621 bytes |
コンパイル時間 | 7,380 ms |
コンパイル使用メモリ | 466,032 KB |
実行使用メモリ | 6,676 KB |
最終ジャッジ日時 | 2024-01-16 22:43:13 |
合計ジャッジ時間 | 30,895 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,676 KB |
testcase_01 | AC | 2 ms
6,676 KB |
testcase_02 | AC | 2 ms
6,676 KB |
testcase_03 | AC | 2 ms
6,676 KB |
testcase_04 | AC | 2 ms
6,676 KB |
testcase_05 | AC | 2 ms
6,676 KB |
testcase_06 | AC | 1 ms
6,676 KB |
testcase_07 | AC | 2 ms
6,676 KB |
testcase_08 | AC | 2 ms
6,676 KB |
testcase_09 | AC | 2 ms
6,676 KB |
testcase_10 | AC | 892 ms
6,676 KB |
testcase_11 | AC | 263 ms
6,676 KB |
testcase_12 | AC | 284 ms
6,676 KB |
testcase_13 | AC | 137 ms
6,676 KB |
testcase_14 | AC | 311 ms
6,676 KB |
testcase_15 | AC | 200 ms
6,676 KB |
testcase_16 | AC | 311 ms
6,676 KB |
testcase_17 | AC | 350 ms
6,676 KB |
testcase_18 | AC | 205 ms
6,676 KB |
testcase_19 | AC | 244 ms
6,676 KB |
testcase_20 | AC | 396 ms
6,676 KB |
testcase_21 | AC | 192 ms
6,676 KB |
testcase_22 | AC | 236 ms
6,676 KB |
testcase_23 | AC | 155 ms
6,676 KB |
testcase_24 | AC | 223 ms
6,676 KB |
testcase_25 | AC | 236 ms
6,676 KB |
testcase_26 | AC | 188 ms
6,676 KB |
testcase_27 | AC | 266 ms
6,676 KB |
testcase_28 | AC | 316 ms
6,676 KB |
testcase_29 | AC | 232 ms
6,676 KB |
testcase_30 | AC | 248 ms
6,676 KB |
testcase_31 | AC | 322 ms
6,676 KB |
testcase_32 | AC | 274 ms
6,676 KB |
testcase_33 | AC | 324 ms
6,676 KB |
testcase_34 | AC | 310 ms
6,676 KB |
testcase_35 | AC | 202 ms
6,676 KB |
testcase_36 | AC | 182 ms
6,676 KB |
testcase_37 | AC | 353 ms
6,676 KB |
testcase_38 | AC | 350 ms
6,676 KB |
testcase_39 | AC | 370 ms
6,676 KB |
testcase_40 | AC | 165 ms
6,676 KB |
testcase_41 | AC | 386 ms
6,676 KB |
testcase_42 | AC | 299 ms
6,676 KB |
testcase_43 | AC | 324 ms
6,676 KB |
testcase_44 | AC | 400 ms
6,676 KB |
testcase_45 | AC | 243 ms
6,676 KB |
testcase_46 | AC | 239 ms
6,676 KB |
testcase_47 | AC | 385 ms
6,676 KB |
testcase_48 | AC | 263 ms
6,676 KB |
testcase_49 | AC | 233 ms
6,676 KB |
testcase_50 | AC | 173 ms
6,676 KB |
testcase_51 | AC | 189 ms
6,676 KB |
testcase_52 | AC | 127 ms
6,676 KB |
testcase_53 | AC | 328 ms
6,676 KB |
testcase_54 | AC | 248 ms
6,676 KB |
testcase_55 | AC | 273 ms
6,676 KB |
testcase_56 | AC | 275 ms
6,676 KB |
testcase_57 | AC | 252 ms
6,676 KB |
testcase_58 | AC | 98 ms
6,676 KB |
testcase_59 | AC | 312 ms
6,676 KB |
testcase_60 | AC | 257 ms
6,676 KB |
testcase_61 | AC | 207 ms
6,676 KB |
testcase_62 | AC | 321 ms
6,676 KB |
testcase_63 | AC | 367 ms
6,676 KB |
testcase_64 | AC | 437 ms
6,676 KB |
testcase_65 | AC | 206 ms
6,676 KB |
testcase_66 | AC | 350 ms
6,676 KB |
testcase_67 | AC | 156 ms
6,676 KB |
testcase_68 | AC | 186 ms
6,676 KB |
testcase_69 | AC | 128 ms
6,676 KB |
testcase_70 | AC | 155 ms
6,676 KB |
testcase_71 | AC | 208 ms
6,676 KB |
testcase_72 | AC | 313 ms
6,676 KB |
testcase_73 | AC | 255 ms
6,676 KB |
testcase_74 | AC | 325 ms
6,676 KB |
testcase_75 | AC | 340 ms
6,676 KB |
testcase_76 | AC | 304 ms
6,676 KB |
testcase_77 | AC | 305 ms
6,676 KB |
testcase_78 | AC | 394 ms
6,676 KB |
testcase_79 | AC | 319 ms
6,676 KB |
testcase_80 | AC | 377 ms
6,676 KB |
ソースコード
#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { 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...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(vector<T> &v){ sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" #include<boost/multiprecision/cpp_int.hpp> using bint = boost::multiprecision::cpp_int; #include<boost/rational.hpp> using rat = boost::rational<bint>; rat make(bint a, bint b){ if (b < 0) return rat(-a,-b); return rat(a,b); } void solve(){ int q; in(q); ll a, b, c, d, e, f; in(a,b,c,d,e,f); ll det = 2*((c-a)*(d-f)-(c-e)*(d-b)); if (det == 0) det = 1; rat x = make((d-f)*(c*c+d*d-a*a-b*b)+(b-d)*(c*c+d*d-e*e-f*f),det); rat y = make((e-c)*(c*c+d*d-a*a-b*b)+(c-a)*(c*c+d*d-e*e-f*f),det); rat r2; { r2 = (rat(a)-x)*(rat(a)-x) + (rat(b)-y)*(rat(b)-y); vector<ll> xs({a,c,e}); vector<ll> ys({b,d,f}); rep(i,3){ ll xi1 = xs[(i+1)%3]; ll xi2 = xs[(i+2)%3]; ll yi1 = ys[(i+1)%3]; ll yi2 = ys[(i+2)%3]; ll x1 = xi1 - xs[i]; ll y1 = yi1 - ys[i]; ll x2 = xi2 - xs[i]; ll y2 = yi2 - ys[i]; ll dot = x1*x2 + y1*y2; if (dot < 0){ x = rat(xi1+xi2,2); y = rat(yi1+yi2,2); r2 = (rat(xi1)-x)*(rat(xi1)-x) + (rat(yi1)-y)*(rat(yi1)-y); } } } while (q--){ ll s, t; in(s,t); rat R2 = (rat(s)-x)*(rat(s)-x) + (rat(t)-y)*(rat(t)-y); yn(R2 <= r2); } } int main(){ int t = 1; //in(t); while (t--) { solve(); } }