#943103 (C++23) No.2602 Real Collider

提出ソース

結果

問題	No.2602 Real Collider
ユーザー	risujiroh
提出日時	2024-01-12 21:31:38
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,143 bytes
コンパイル時間	2,856 ms
コンパイル使用メモリ	262,048 KB
実行使用メモリ	6,944 KB
最終ジャッジ日時	2024-09-27 21:23:15
合計ジャッジ時間	8,474 ms
ジャッジサーバーID （参考情報）	judge5 / judge3

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	1 ms 5,376 KB
testcase_02	AC	1 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	WA	-
testcase_05	AC	1 ms 5,376 KB
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	AC	29 ms 5,376 KB
testcase_12	AC	45 ms 5,376 KB
testcase_13	AC	21 ms 5,376 KB
testcase_14	AC	44 ms 5,376 KB
testcase_15	AC	22 ms 5,376 KB
testcase_16	AC	34 ms 5,376 KB
testcase_17	AC	38 ms 5,376 KB
testcase_18	AC	29 ms 5,376 KB
testcase_19	AC	33 ms 5,376 KB
testcase_20	AC	45 ms 5,376 KB
testcase_21	AC	26 ms 5,376 KB
testcase_22	AC	32 ms 5,376 KB
testcase_23	AC	21 ms 5,376 KB
testcase_24	AC	31 ms 5,376 KB
testcase_25	AC	32 ms 5,376 KB
testcase_26	AC	22 ms 5,376 KB
testcase_27	AC	35 ms 5,376 KB
testcase_28	AC	38 ms 5,376 KB
testcase_29	AC	31 ms 5,376 KB
testcase_30	AC	34 ms 5,376 KB
testcase_31	AC	36 ms 5,376 KB
testcase_32	AC	29 ms 5,376 KB
testcase_33	AC	35 ms 5,376 KB
testcase_34	AC	34 ms 5,376 KB
testcase_35	AC	23 ms 5,376 KB
testcase_36	AC	23 ms 5,376 KB
testcase_37	AC	38 ms 5,376 KB
testcase_38	AC	39 ms 5,376 KB
testcase_39	AC	38 ms 5,376 KB
testcase_40	AC	19 ms 5,376 KB
testcase_41	AC	43 ms 5,376 KB
testcase_42	AC	33 ms 5,376 KB
testcase_43	AC	34 ms 5,376 KB
testcase_44	AC	44 ms 5,376 KB
testcase_45	AC	28 ms 5,376 KB
testcase_46	AC	27 ms 5,376 KB
testcase_47	AC	39 ms 5,376 KB
testcase_48	AC	30 ms 5,376 KB
testcase_49	AC	26 ms 5,376 KB
testcase_50	AC	20 ms 5,376 KB
testcase_51	AC	21 ms 5,376 KB
testcase_52	AC	15 ms 5,376 KB
testcase_53	AC	37 ms 5,376 KB
testcase_54	AC	28 ms 5,376 KB
testcase_55	AC	32 ms 5,376 KB
testcase_56	AC	31 ms 5,376 KB
testcase_57	AC	29 ms 5,376 KB
testcase_58	AC	12 ms 5,376 KB
testcase_59	AC	37 ms 5,376 KB
testcase_60	AC	33 ms 5,376 KB
testcase_61	AC	25 ms 5,376 KB
testcase_62	AC	38 ms 5,376 KB
testcase_63	AC	41 ms 5,376 KB
testcase_64	AC	47 ms 5,376 KB
testcase_65	AC	25 ms 5,376 KB
testcase_66	AC	40 ms 5,376 KB
testcase_67	AC	18 ms 5,376 KB
testcase_68	AC	23 ms 5,376 KB
testcase_69	AC	15 ms 5,376 KB
testcase_70	AC	19 ms 5,376 KB
testcase_71	AC	23 ms 5,376 KB
testcase_72	AC	33 ms 5,376 KB
testcase_73	AC	29 ms 5,376 KB
testcase_74	AC	36 ms 5,376 KB
testcase_75	AC	38 ms 5,376 KB
testcase_76	AC	34 ms 5,376 KB
testcase_77	AC	37 ms 5,376 KB
testcase_78	AC	44 ms 5,376 KB
testcase_79	AC	37 ms 5,376 KB
testcase_80	AC	44 ms 5,376 KB

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

ソースコード

raw source code

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

using kactl::P;

void solve() {
  int q;
  scan(q);
  P A, B, C;
  scan(A.x, A.y, B.x, B.y, C.x, C.y);
  const auto [o, r] = kactl::mec({A, B, C});
  while (q--) {
    P p;
    scan(p.x, p.y);
    const bool ans = (p - o).dist() < r + 1e-10;
    print(ans ? "Yes" : "No");
  }
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  solve();
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

// https://github.com/kth-competitive-programming/kactl
namespace kactl {

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

template <class T>
int sgn(T x) {
  return (x > 0) - (x < 0);
}
template <class T>
struct Point {
  typedef Point P;
  T x, y;
  explicit Point(T x = 0, T y = 0) : x(x), y(y) {}
  bool operator<(P p) const { return tie(x, y) < tie(p.x, p.y); }
  bool operator==(P p) const { return tie(x, y) == tie(p.x, p.y); }
  P operator+(P p) const { return P(x + p.x, y + p.y); }
  P operator-(P p) const { return P(x - p.x, y - p.y); }
  P operator*(T d) const { return P(x * d, y * d); }
  P operator/(T d) const { return P(x / d, y / d); }
  T dot(P p) const { return x * p.x + y * p.y; }
  T cross(P p) const { return x * p.y - y * p.x; }
  T cross(P a, P b) const { return (a - *this).cross(b - *this); }
  T dist2() const { return x * x + y * y; }
  double dist() const { return sqrt((double)dist2()); }
  double angle() const { return atan2(y, x); }
  P unit() const { return *this / dist(); }
  P perp() const { return P(-y, x); }
  P normal() const { return perp().unit(); }
  P rotate(double a) const { return P(x * cos(a) - y * sin(a), x * sin(a) + y * cos(a)); }
  friend ostream& operator<<(ostream& os, P p) { return os << "(" << p.x << "," << p.y << ")"; }
};

typedef Point<double> P;
double ccRadius(const P& A, const P& B, const P& C) {
  return (B - A).dist() * (C - B).dist() * (A - C).dist() / abs((B - A).cross(C - A)) / 2;
}
P ccCenter(const P& A, const P& B, const P& C) {
  P b = C - A, c = B - A;
  return A + (b * c.dist2() - c * b.dist2()).perp() / b.cross(c) / 2;
}

pair<P, double> mec(vector<P> ps) {
  shuffle(all(ps), mt19937(time(0)));
  P o = ps[0];
  double r = 0, EPS = 1 + 1e-8;
  rep(i, 0, sz(ps)) if ((o - ps[i]).dist() > r * EPS) {
    o = ps[i], r = 0;
    rep(j, 0, i) if ((o - ps[j]).dist() > r * EPS) {
      o = (ps[i] + ps[j]) / 2;
      r = (o - ps[i]).dist();
      rep(k, 0, j) if ((o - ps[k]).dist() > r * EPS) {
        o = ccCenter(ps[i], ps[j], ps[k]);
        r = (o - ps[i]).dist();
      }
    }
  }
  return {o, r};
}

#undef sz
#undef all
#undef rep

}  // namespace kactl

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <std::signed_integral T = int>
T inf() {
  T ret;
  std::memset(&ret, 0x3f, sizeof(ret));
  return ret;
}

template <std::floating_point T>
T inf() {
  return std::numeric_limits<T>::infinity();
}

template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept TupleLike = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, TupleLike auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  string_view sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, TupleLike auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

#define DEF_INC_OR_DEC(op) \
  auto& operator op(Range auto&& r) { \
    for (auto&& e : r) { \
      op e; \
    } \
    return r; \
  } \
  auto& operator op(TupleLike auto&& t) { \
    apply([](auto&... xs) { (op xs, ...); }, t); \
    return t; \
  }

DEF_INC_OR_DEC(++)
DEF_INC_OR_DEC(--)

#undef DEF_INC_OR_DEC

}  // namespace std

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

#define FWD(...) static_cast<decltype(__VA_ARGS__)&&>(__VA_ARGS__)

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const { return f_(std::ref(*this), FWD(xs)...); }

 private:
  F f_;
};

template <class T>
concept LambdaExpr = std::is_placeholder_v<std::remove_cvref_t<T>> != 0 ||
                     std::is_bind_expression_v<std::remove_cvref_t<T>>;

auto operator++(LambdaExpr auto&& x, int) {
  return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)++; }, FWD(x));
}

auto operator--(LambdaExpr auto&& x, int) {
  return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)--; }, FWD(x));
}

#define DEF_UNARY_OP(op) \
  auto operator op(LambdaExpr auto&& x) { \
    return std::bind([](auto&& x) -> decltype(auto) { return op FWD(x); }, FWD(x)); \
  }

DEF_UNARY_OP(++)
DEF_UNARY_OP(--)
DEF_UNARY_OP(+)
DEF_UNARY_OP(-)
DEF_UNARY_OP(~)
DEF_UNARY_OP(!)
DEF_UNARY_OP(*)
DEF_UNARY_OP(&)

#undef DEF_UNARY_OP

#define DEF_BINARY_OP(op) \
  template <class T1, class T2> \
    requires LambdaExpr<T1> || LambdaExpr<T2> \
  auto operator op(T1&& x, T2&& y) { \
    return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x) op FWD(y); }, \
                     FWD(x), FWD(y)); \
  }

DEF_BINARY_OP(+=)
DEF_BINARY_OP(-=)
DEF_BINARY_OP(*=)
DEF_BINARY_OP(/=)
DEF_BINARY_OP(%=)
DEF_BINARY_OP(^=)
DEF_BINARY_OP(&=)
DEF_BINARY_OP(|=)
DEF_BINARY_OP(<<=)
DEF_BINARY_OP(>>=)
DEF_BINARY_OP(+)
DEF_BINARY_OP(-)
DEF_BINARY_OP(*)
DEF_BINARY_OP(/)
DEF_BINARY_OP(%)
DEF_BINARY_OP(^)
DEF_BINARY_OP(&)
DEF_BINARY_OP(|)
DEF_BINARY_OP(<<)
DEF_BINARY_OP(>>)
DEF_BINARY_OP(==)
DEF_BINARY_OP(!=)
DEF_BINARY_OP(<)
DEF_BINARY_OP(>)
DEF_BINARY_OP(<=)
DEF_BINARY_OP(>=)
DEF_BINARY_OP(&&)
DEF_BINARY_OP(||)

#undef DEF_BINARY_OP

template <class T1, class T2>
  requires LambdaExpr<T1> || LambdaExpr<T2>
auto at(T1&& x, T2&& y) {
  return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x)[FWD(y)]; }, FWD(x),
                   FWD(y));
}

template <int I>
auto get(LambdaExpr auto&& x) {
  return std::bind([](auto&& x) -> decltype(auto) { return std::get<I>(FWD(x)); }, FWD(x));
}

inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }

using namespace std::literals;
using namespace std::placeholders;

namespace ranges = std::ranges;
namespace views = std::views;

using i64 = std::int64_t;

#endif  // __INCLUDE_LEVEL__

yukicoder

結果

テストケース

ソースコード