Luzhiled's Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub ei1333/library

:heavy_check_mark: test/verify/aoj-cgl-2-a.test.cpp

Depends on

Code

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

#include <iomanip>
#include <iostream>

#include "../../geometry/is_orthogonal.hpp"
#include "../../geometry/is_parallel.hpp"

using namespace std;
using namespace geometry;

int main() {
  cout << fixed << setprecision(10);
  int Q;
  cin >> Q;
  while (Q--) {
    Line s1, s2;
    cin >> s1 >> s2;
    if (is_parallel(s1, s2))
      cout << "2\n";
    else if (is_orthogonal(s1, s2))
      cout << "1\n";
    else
      cout << "0\n";
  }
}
#line 1 "test/verify/aoj-cgl-2-a.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A
// clang-format on

#include <iomanip>
#include <iostream>

#line 2 "geometry/is_orthogonal.hpp"

#line 2 "geometry/line.hpp"

#include <cassert>
#line 5 "geometry/line.hpp"
#include <vector>

#line 2 "geometry/point.hpp"

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

#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 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 5 "geometry/is_orthogonal.hpp"

namespace geometry {
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A
bool is_orthogonal(const Line& a, const Line& b) {
  return equals(dot(a.a - a.b, b.a - b.b), 0.0);
}
}  // namespace geometry
#line 2 "geometry/is_parallel.hpp"

#line 5 "geometry/is_parallel.hpp"

namespace geometry {
// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A
bool is_parallel(const Line& a, const Line& b) {
  return equals(cross(a.b - a.a, b.b - b.a), 0.0);
}
}  // namespace geometry
#line 10 "test/verify/aoj-cgl-2-a.test.cpp"

using namespace std;
using namespace geometry;

int main() {
  cout << fixed << setprecision(10);
  int Q;
  cin >> Q;
  while (Q--) {
    Line s1, s2;
    cin >> s1 >> s2;
    if (is_parallel(s1, s2))
      cout << "2\n";
    else if (is_orthogonal(s1, s2))
      cout << "1\n";
    else
      cout << "0\n";
  }
}

Test cases

Env Name Status Elapsed Memory
g++ 00_small_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 00_small_01 :heavy_check_mark: AC 2 ms 4 MB
g++ 00_small_02 :heavy_check_mark: AC 2 ms 4 MB
g++ 00_small_03 :heavy_check_mark: AC 2 ms 4 MB
g++ 02_horizontal_00 :heavy_check_mark: AC 5 ms 4 MB
g++ 02_horizontal_01 :heavy_check_mark: AC 5 ms 4 MB
g++ 03_vertical_00 :heavy_check_mark: AC 5 ms 4 MB
g++ 03_vertical_01 :heavy_check_mark: AC 5 ms 4 MB
g++ 04_extreme_00 :heavy_check_mark: AC 2 ms 4 MB
g++ 04_extreme_01 :heavy_check_mark: AC 2 ms 4 MB
g++ 05_rand_00 :heavy_check_mark: AC 3 ms 4 MB
g++ 05_rand_01 :heavy_check_mark: AC 3 ms 4 MB
g++ 05_rand_02 :heavy_check_mark: AC 3 ms 4 MB
g++ 05_rand_03 :heavy_check_mark: AC 3 ms 4 MB
g++ 06_rand_00 :heavy_check_mark: AC 9 ms 4 MB
g++ 06_rand_01 :heavy_check_mark: AC 9 ms 4 MB
g++ 06_rand_02 :heavy_check_mark: AC 9 ms 4 MB
g++ 06_rand_03 :heavy_check_mark: AC 10 ms 4 MB
g++ 06_rand_04 :heavy_check_mark: AC 9 ms 4 MB
g++ 06_rand_05 :heavy_check_mark: AC 10 ms 4 MB
g++ 06_rand_06 :heavy_check_mark: AC 10 ms 4 MB
g++ 06_rand_07 :heavy_check_mark: AC 10 ms 4 MB
g++ 06_rand_08 :heavy_check_mark: AC 9 ms 4 MB
g++ 06_rand_09 :heavy_check_mark: AC 10 ms 4 MB
g++ 06_rand_10 :heavy_check_mark: AC 10 ms 4 MB
g++ 06_rand_11 :heavy_check_mark: AC 10 ms 4 MB
g++ 06_rand_12 :heavy_check_mark: AC 10 ms 4 MB
g++ 06_rand_13 :heavy_check_mark: AC 10 ms 4 MB
g++ 07_rand_00 :heavy_check_mark: AC 10 ms 4 MB
g++ 07_rand_01 :heavy_check_mark: AC 10 ms 4 MB
g++ 07_rand_02 :heavy_check_mark: AC 9 ms 4 MB
g++ 07_rand_03 :heavy_check_mark: AC 9 ms 4 MB
clang++ 00_small_00 :heavy_check_mark: AC 3 ms 4 MB
clang++ 00_small_01 :heavy_check_mark: AC 2 ms 4 MB
clang++ 00_small_02 :heavy_check_mark: AC 2 ms 4 MB
clang++ 00_small_03 :heavy_check_mark: AC 2 ms 4 MB
clang++ 02_horizontal_00 :heavy_check_mark: AC 5 ms 4 MB
clang++ 02_horizontal_01 :heavy_check_mark: AC 5 ms 4 MB
clang++ 03_vertical_00 :heavy_check_mark: AC 5 ms 4 MB
clang++ 03_vertical_01 :heavy_check_mark: AC 5 ms 4 MB
clang++ 04_extreme_00 :heavy_check_mark: AC 2 ms 4 MB
clang++ 04_extreme_01 :heavy_check_mark: AC 2 ms 4 MB
clang++ 05_rand_00 :heavy_check_mark: AC 3 ms 4 MB
clang++ 05_rand_01 :heavy_check_mark: AC 3 ms 4 MB
clang++ 05_rand_02 :heavy_check_mark: AC 4 ms 4 MB
clang++ 05_rand_03 :heavy_check_mark: AC 3 ms 4 MB
clang++ 06_rand_00 :heavy_check_mark: AC 9 ms 4 MB
clang++ 06_rand_01 :heavy_check_mark: AC 9 ms 4 MB
clang++ 06_rand_02 :heavy_check_mark: AC 9 ms 4 MB
clang++ 06_rand_03 :heavy_check_mark: AC 10 ms 4 MB
clang++ 06_rand_04 :heavy_check_mark: AC 9 ms 4 MB
clang++ 06_rand_05 :heavy_check_mark: AC 9 ms 4 MB
clang++ 06_rand_06 :heavy_check_mark: AC 10 ms 4 MB
clang++ 06_rand_07 :heavy_check_mark: AC 9 ms 4 MB
clang++ 06_rand_08 :heavy_check_mark: AC 9 ms 4 MB
clang++ 06_rand_09 :heavy_check_mark: AC 8 ms 4 MB
clang++ 06_rand_10 :heavy_check_mark: AC 5 ms 4 MB
clang++ 06_rand_11 :heavy_check_mark: AC 5 ms 4 MB
clang++ 06_rand_12 :heavy_check_mark: AC 5 ms 4 MB
clang++ 06_rand_13 :heavy_check_mark: AC 5 ms 4 MB
clang++ 07_rand_00 :heavy_check_mark: AC 6 ms 4 MB
clang++ 07_rand_01 :heavy_check_mark: AC 6 ms 4 MB
clang++ 07_rand_02 :heavy_check_mark: AC 5 ms 4 MB
clang++ 07_rand_03 :heavy_check_mark: AC 5 ms 4 MB
Back to top page