test/verify/aoj-cgl-2-b.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_2_B

Depends on

• geometry/base.hpp
• geometry/ccw.hpp
• geometry/is_intersect_ss.hpp
• geometry/line.hpp
• geometry/point.hpp
• geometry/segment.hpp

Code

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

#include <iomanip>
#include <iostream>

#include "../../geometry/is_intersect_ss.hpp"

using namespace std;
using namespace geometry;

int main() {
  cout << fixed << setprecision(10);
  int T;
  cin >> T;
  while (T--) {
    Segment a, b;
    cin >> a >> b;
    cout << is_intersect_ss(a, b) << "\n";
  }
}

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

#include <iomanip>
#include <iostream>

#line 2 "geometry/is_intersect_ss.hpp"

#line 2 "geometry/ccw.hpp"

#include <complex>

#line 2 "geometry/point.hpp"

#include <cmath>
#line 6 "geometry/point.hpp"
#include <vector>

#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 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/ccw.hpp"

namespace geometry {
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C
constexpr int COUNTER_CLOCKWISE = +1;
constexpr int CLOCKWISE = -1;
constexpr int ONLINE_BACK = +2;   // c-a-b
constexpr int ONLINE_FRONT = -2;  // a-b-c
constexpr int ON_SEGMENT = 0;     // a-c-b
int ccw(const Point& a, Point b, Point c) {
  b = b - a, c = c - a;
  if (sign(cross(b, c)) == +1) return COUNTER_CLOCKWISE;
  if (sign(cross(b, c)) == -1) return CLOCKWISE;
  if (sign(dot(b, c)) == -1) return ONLINE_BACK;
  if (std::norm(b) < std::norm(c)) return ONLINE_FRONT;
  return ON_SEGMENT;
}
}  // namespace geometry
#line 2 "geometry/segment.hpp"

#line 4 "geometry/segment.hpp"

#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 6 "geometry/segment.hpp"

namespace geometry {
struct Segment : Line {
  Segment() = default;

  using Line::Line;
};

using Segments = std::vector<Segment>;
}  // namespace geometry
#line 6 "geometry/is_intersect_ss.hpp"

namespace geometry {
bool is_intersect_ss(const Segment& s, const Segment& t) {
  return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&
         ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;
}
}  // namespace geometry
#line 9 "test/verify/aoj-cgl-2-b.test.cpp"

using namespace std;
using namespace geometry;

int main() {
  cout << fixed << setprecision(10);
  int T;
  cin >> T;
  while (T--) {
    Segment a, b;
    cin >> a >> b;
    cout << is_intersect_ss(a, b) << "\n";
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_small_00	AC	2 ms	4 MB
g++	00_small_01	AC	2 ms	4 MB
g++	00_small_02	AC	2 ms	4 MB
g++	00_small_03	AC	2 ms	4 MB
g++	01_online_00	AC	2 ms	4 MB
g++	01_online_01	AC	2 ms	4 MB
g++	02_parallel_00	AC	2 ms	4 MB
g++	02_parallel_01	AC	2 ms	4 MB
g++	03_horizontal_00	AC	5 ms	4 MB
g++	03_horizontal_01	AC	5 ms	4 MB
g++	04_vertical_00	AC	5 ms	4 MB
g++	04_vertical_01	AC	5 ms	4 MB
g++	05_rand_00	AC	6 ms	4 MB
g++	05_rand_01	AC	6 ms	4 MB
g++	05_rand_02	AC	6 ms	4 MB
g++	05_rand_03	AC	6 ms	4 MB
g++	06_rand_00	AC	10 ms	4 MB
g++	06_rand_01	AC	9 ms	4 MB
g++	06_rand_02	AC	7 ms	4 MB
g++	06_rand_03	AC	6 ms	4 MB
clang++	00_small_00	AC	2 ms	4 MB
clang++	00_small_01	AC	2 ms	4 MB
clang++	00_small_02	AC	2 ms	4 MB
clang++	00_small_03	AC	2 ms	4 MB
clang++	01_online_00	AC	2 ms	4 MB
clang++	01_online_01	AC	2 ms	4 MB
clang++	02_parallel_00	AC	2 ms	4 MB
clang++	02_parallel_01	AC	2 ms	4 MB
clang++	03_horizontal_00	AC	4 ms	4 MB
clang++	03_horizontal_01	AC	4 ms	4 MB
clang++	04_vertical_00	AC	4 ms	4 MB
clang++	04_vertical_01	AC	4 ms	4 MB
clang++	05_rand_00	AC	4 ms	4 MB
clang++	05_rand_01	AC	4 ms	4 MB
clang++	05_rand_02	AC	4 ms	4 MB
clang++	05_rand_03	AC	4 ms	4 MB
clang++	06_rand_00	AC	5 ms	4 MB
clang++	06_rand_01	AC	10 ms	4 MB
clang++	06_rand_02	AC	6 ms	4 MB
clang++	06_rand_03	AC	6 ms	4 MB

Back to top page