test/verify/aoj-cgl-7-d.test.cpp

• View this file on GitHub
• Last update: 2026-08-10 10:57:54+00:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D

Depends on

• geometry/base.hpp
• geometry/circle.hpp
• geometry/cross_point_cl.hpp
• geometry/line.hpp
• geometry/point.hpp
• geometry/projection.hpp

Code

// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D
// clang-format on
// competitive-verifier: ERROR 0.000001

#include <iomanip>
#include <iostream>
#include <utility>

#include "../../geometry/cross_point_cl.hpp"

using namespace std;
using namespace geometry;

int main() {
  cout << fixed << setprecision(10);
  Circle c;
  cin >> c.p >> c.r;
  int Q;
  cin >> Q;
  while (Q--) {
    Line l;
    cin >> l;
    auto ret = cross_point_cl(c, l);
    if (ret.size() == 1) ret.emplace_back(ret[0]);
    if (!compare_x(ret[0], ret[1])) swap(ret[0], ret[1]);
    cout << ret[0] << " " << ret[1] << "\n";
  }
}

#line 1 "test/verify/aoj-cgl-7-d.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D
// clang-format on
// competitive-verifier: ERROR 0.000001

#include <iomanip>
#include <iostream>
#include <utility>

#line 2 "geometry/cross_point_cl.hpp"

#include <cmath>

#line 2 "geometry/base.hpp"

#line 4 "geometry/base.hpp"

namespace geometry {
using Real = double;
const Real EPS = 1e-8;
const Real PI = std::acos(static_cast<Real>(-1));

enum { OUT, ON, IN };

inline int sign(const Real& r) { return r <= -EPS ? -1 : r >= EPS ? 1 : 0; }

inline bool equals(const Real& a, const Real& b) { return sign(a - b) == 0; }
}  // namespace geometry
#line 2 "geometry/circle.hpp"

#include <vector>

#line 2 "geometry/point.hpp"

#line 4 "geometry/point.hpp"
#include <complex>
#line 7 "geometry/point.hpp"

#line 9 "geometry/point.hpp"

namespace geometry {
using Point = std::complex<Real>;

std::istream& operator>>(std::istream& is, Point& p) {
  Real a, b;
  is >> a >> b;
  p = Point(a, b);
  return is;
}

std::ostream& operator<<(std::ostream& os, const Point& p) {
  return os << std::real(p) << " " << std::imag(p);
}

Point operator*(const Point& p, const Real& d) {
  return Point(std::real(p) * d, std::imag(p) * d);
}

// rotate point p counterclockwise by theta rad
Point rotate(Real theta, const Point& p) {
  return Point(std::cos(theta) * std::real(p) - std::sin(theta) * std::imag(p),
               std::sin(theta) * std::real(p) + std::cos(theta) * std::imag(p));
}

Real cross(const Point& a, const Point& b) {
  return std::real(a) * std::imag(b) - std::imag(a) * std::real(b);
}

Real dot(const Point& a, const Point& b) {
  return std::real(a) * std::real(b) + std::imag(a) * std::imag(b);
}

bool compare_x(const Point& a, const Point& b) {
  return equals(std::real(a), std::real(b)) ? std::imag(a) < std::imag(b)
                                            : std::real(a) < std::real(b);
}

bool compare_y(const Point& a, const Point& b) {
  return equals(std::imag(a), std::imag(b)) ? std::real(a) < std::real(b)
                                            : std::imag(a) < std::imag(b);
}

using Points = std::vector<Point>;
}  // namespace geometry
#line 6 "geometry/circle.hpp"

namespace geometry {
struct Circle {
  Point p;
  Real r{};

  Circle() = default;

  Circle(const Point& p, const Real& r) : p(p), r(r) {}
};

using Circles = std::vector<Circle>;
}  // namespace geometry
#line 2 "geometry/line.hpp"

#include <cassert>
#line 6 "geometry/line.hpp"

#line 8 "geometry/line.hpp"

namespace geometry {
struct Line {
  Point a, b;

  Line() = default;

  Line(const Point& a, const Point& b) : a(a), b(b) {}

  Line(const Real& A, const Real& B, const Real& C) {  // Ax+By=C
    if (equals(A, 0)) {
      assert(!equals(B, 0));
      a = Point(0, C / B);
      b = Point(1, C / B);
    } else if (equals(B, 0)) {
      a = Point(C / A, 0);
      b = Point(C / A, 1);
    } else if (equals(C, 0)) {
      a = Point(0, C / B);
      b = Point(1, (C - A) / B);
    } else {
      a = Point(0, C / B);
      b = Point(C / A, 0);
    }
  }

  friend std::ostream& operator<<(std::ostream& os, Line& l) {
    return os << l.a << " to " << l.b;
  }

  friend std::istream& operator>>(std::istream& is, Line& l) {
    return is >> l.a >> l.b;
  }
};

using Lines = std::vector<Line>;
}  // namespace geometry
#line 2 "geometry/projection.hpp"

#line 4 "geometry/projection.hpp"

#line 7 "geometry/projection.hpp"

namespace geometry {
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A
Point projection(const Line& l, const Point& p) {
  auto t = dot(p - l.a, l.a - l.b) / std::norm(l.a - l.b);
  return l.a + (l.a - l.b) * t;
}
}  // namespace geometry
#line 10 "geometry/cross_point_cl.hpp"

namespace geometry {
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D
Points cross_point_cl(const Circle& c, const Line& l) {
  Point pr = projection(l, c.p);
  if (equals(std::abs(pr - c.p), c.r)) return {pr};
  Point e = (l.b - l.a) / std::abs(l.b - l.a);
  auto k = std::sqrt(std::norm(c.r) - std::norm(pr - c.p));
  return {pr - e * k, pr + e * k};
}
}  // namespace geometry
#line 11 "test/verify/aoj-cgl-7-d.test.cpp"

using namespace std;
using namespace geometry;

int main() {
  cout << fixed << setprecision(10);
  Circle c;
  cin >> c.p >> c.r;
  int Q;
  cin >> Q;
  while (Q--) {
    Line l;
    cin >> l;
    auto ret = cross_point_cl(c, l);
    if (ret.size() == 1) ret.emplace_back(ret[0]);
    if (!compare_x(ret[0], ret[1])) swap(ret[0], ret[1]);
    cout << ret[0] << " " << ret[1] << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample_00	AC	2 ms	4 MB
g++	01_general_00	AC	2 ms	4 MB
g++	02_corner_00	AC	2 ms	4 MB
g++	03_maximum_00	AC	2 ms	4 MB
g++	04_rand_00	AC	2 ms	4 MB
g++	04_rand_01	AC	2 ms	4 MB
g++	04_rand_02	AC	2 ms	4 MB
g++	04_rand_03	AC	2 ms	4 MB
g++	05_rand_00	AC	2 ms	4 MB
g++	05_rand_01	AC	2 ms	4 MB
g++	05_rand_02	AC	2 ms	4 MB
g++	05_rand_03	AC	2 ms	4 MB
clang++	00_sample_00	AC	2 ms	4 MB
clang++	01_general_00	AC	2 ms	4 MB
clang++	02_corner_00	AC	2 ms	4 MB
clang++	03_maximum_00	AC	2 ms	4 MB
clang++	04_rand_00	AC	2 ms	4 MB
clang++	04_rand_01	AC	2 ms	4 MB
clang++	04_rand_02	AC	2 ms	4 MB
clang++	04_rand_03	AC	2 ms	4 MB
clang++	05_rand_00	AC	2 ms	4 MB
clang++	05_rand_01	AC	2 ms	4 MB
clang++	05_rand_02	AC	2 ms	4 MB
clang++	05_rand_03	AC	2 ms	4 MB

Back to top page