This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub Luzhiled/comp-geometry
// verification-helper: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/CGL_7_A #include <iostream> #include "src/real-geometry/position/intersect-cc.hpp" int main() { using R = long double; geometry::circle<R> c1, c2; std::cin >> c1.o >> c1.r; std::cin >> c2.o >> c2.r; std::cout << geometry::intersect_cc(c1, c2) << std::endl; }
#line 1 "test/aoj/cgl/7_A.test.cpp" // verification-helper: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/CGL_7_A #include <iostream> #line 2 "src/real-geometry/position/intersect-cc.hpp" #line 2 "src/real-geometry/class/circle.hpp" #line 2 "src/real-geometry/class/point.hpp" #line 2 "src/real-geometry/class/vector.hpp" #include <complex> #line 5 "src/real-geometry/class/vector.hpp" namespace geometry { template< typename R > class vec2d : public std::complex< R > { using complex = std::complex< R >; public: using complex::complex; vec2d(const complex &c): complex::complex(c) {} const R x() const { return this->real(); } const R y() const { return this->imag(); } friend vec2d operator*(const vec2d &v, const R &k) { return vec2d(v.x() * k, v.y() * k); } friend vec2d operator*(const R &k, const vec2d &v) { return vec2d(v.x() * k, v.y() * k); } friend std::istream &operator>>(std::istream &is, vec2d &v) { R x, y; is >> x >> y; v = vec2d(x, y); return is; } }; } #line 4 "src/real-geometry/class/point.hpp" #include <vector> namespace geometry { template< typename R > using point = vec2d<R>; template< typename R > using points = std::vector< point< R > >; } #line 4 "src/real-geometry/class/circle.hpp" #line 6 "src/real-geometry/class/circle.hpp" // circle namespace geometry { template< typename R > class circle { public: point<R> o; R r; circle() = default; circle(point<R> o, R r) : o(o), r(r) {} const point<R> center() const { return o; } const R radius() const { return r; } }; template< typename R > using circles = std::vector< circle<R> >; } #line 2 "src/real-geometry/utility/equals/real-number.hpp" #line 2 "src/real-geometry/utility/sign.hpp" #line 2 "src/real-geometry/common/const/eps.hpp" #line 2 "src/real-geometry/common/float-alias.hpp" namespace geometry { using f80 = long double; using f64 = double; } #line 4 "src/real-geometry/common/const/eps.hpp" namespace geometry { inline static f80 &eps() { static f80 EPS = 1e-10; return EPS; } void set_eps(f80 EPS) { eps() = EPS; } } #line 2 "src/real-geometry/numbers/sign.hpp" #line 2 "src/real-geometry/common/int-alias.hpp" namespace geometry { using i32 = int; using i64 = long long; } #line 4 "src/real-geometry/numbers/sign.hpp" namespace geometry::number::sign { constexpr i32 PLUS = +1; constexpr i32 ZERO = 0; constexpr i32 MINUS = -1; } #line 5 "src/real-geometry/utility/sign.hpp" namespace geometry { using namespace geometry::number::sign; template< typename R > inline int sign(R r) { if (r < -eps()) return MINUS; if (r > +eps()) return PLUS; return ZERO; } } #line 4 "src/real-geometry/utility/equals/real-number.hpp" namespace geometry { template< typename R > bool equals(R a, R b) { return sign(a - b) == 0; } } #line 6 "src/real-geometry/position/intersect-cc.hpp" #include <algorithm> #line 9 "src/real-geometry/position/intersect-cc.hpp" namespace geometry { constexpr int SEPERATE = 4; constexpr int CIRCUMSCRIBE = 3; constexpr int INTERSECT = 2; constexpr int INSCRIBE = 1; constexpr int CONTAIN = 0; template< typename R > int intersect_cc(circle<R> c1, circle<R> c2) { if (c1.r > c2.r) std::swap(c1, c2); R d = std::abs(c1.o - c2.o), r = c1.r + c2.r; if (sign(d - r) > 0) return SEPERATE; if (sign(d + c1.r - c2.r) < 0) return CONTAIN; if (equals(d, r)) return CIRCUMSCRIBE; if (equals(d + c1.r, c2.r)) return INSCRIBE; return INTERSECT; } } #line 6 "test/aoj/cgl/7_A.test.cpp" int main() { using R = long double; geometry::circle<R> c1, c2; std::cin >> c1.o >> c1.r; std::cin >> c2.o >> c2.r; std::cout << geometry::intersect_cc(c1, c2) << std::endl; }