test/geometry/Intersection.test.cpp

View this file on GitHub
Last update: 2023-06-08 15:34:10+09:00
Problem: https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/2/CGL_2_B

Depends on

Code

#define PROBLEM \
    "https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/2/CGL_2_B"

#include "../../geometry/segment.hpp"

using namespace lib;

int main() {
    int q;
    std::cin >> q;
    while (q--) {
        vec p0, p1, p2, p3;
        auto input = [](vec &p) {
            ld x, y;
            std::cin >> x >> y;
            p = {x, y};
        };
        input(p0);
        input(p1);
        input(p2);
        input(p3);
        segment s1 = {p0, p1};
        segment s2 = {p2, p3};
        int flag = intersection_segment(s1, s2);
        std::cout << flag << '\n';
    }
}

#line 1 "test/geometry/Intersection.test.cpp"
#define PROBLEM \
    "https://onlinejudge.u-aizu.ac.jp/courses/library/4/CGL/2/CGL_2_B"

#line 2 "geometry/segment.hpp"

#line 2 "geometry/line.hpp"

#line 2 "geometry/base_ld.hpp"

#line 2 "template/template.hpp"

#include <bits/stdc++.h>

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <typename T> bool chmin(T &a, const T &b) {
    if (a <= b) return false;
    a = b;
    return true;
}
template <typename T> bool chmax(T &a, const T &b) {
    if (a >= b) return false;
    a = b;
    return true;
}

namespace lib {

using namespace std;

}  // namespace lib

// using namespace lib;
#line 4 "geometry/base_ld.hpp"

namespace lib {

using vec = complex<ld>;

const ld PI = acos(-1);

void ldout(int len = 20) {
    cout << fixed << setprecision(len);
}

int sgn(ld a, const ld eps = 1e-7) {
    return (a < -eps) ? -1 : (a > eps) ? 1 : 0;
}

bool same_vec(vec a, vec b) {
    a -= b;
    return sgn(a.real()) == 0 && sgn(a.imag()) == 0;
}

ld dot(const vec &a, const vec &b) {
    return (conj(a) * b).real();
}

ld cross(const vec &a, const vec &b) {
    return (conj(a) * b).imag();
}

int isp(const vec &a, const vec &b, const vec &c) {
    int cross_sgn = sgn(cross(b - a, c - a));
    if (cross_sgn == 0) {
        if (sgn(dot(b - a, c - a)) < 0) return -2;
        if (sgn(dot(a - b, c - b)) < 0) return 2;
    }
    return cross_sgn;
}

vec rot90(const vec &a) {
    return {-a.imag(), a.real()};
}

vec rot(const vec &a, ld rad) {
    return a * vec(cosl(rad), sinl(rad));
}

bool comp_for_argument_sort(const vec &lhs, const vec &rhs) {
    // if (abs(arg(lhs)-arg(rhs)) < eps) return false; // need ?
    return arg(lhs) < arg(rhs);
}

}  // namespace lib
#line 4 "geometry/line.hpp"

namespace lib {

struct line {
    vec a, b;
};

vec proj(const line &l, const vec &p) {
    vec ab = l.b - l.a;
    return l.a + ab * (dot(ab, p - l.a) / norm(ab));
}

vec refl(const line &l, const vec &p) {
    return proj(l, p) * ld(2) - p;
}

int intersection(const line &a, const line &b) {
    if (sgn(cross(a.b - a.a, b.a - b.b)) != 0) {
        if (sgn(dot(a.b - a.a, b.a - b.b)) == 0) {
            return 1;
        }
        return 0;
    } else if (sgn(cross(a.b - a.a, b.a - a.a)) != 0) {
        return 2;
    } else {
        return 3;
    }
}

ld dist(const line &a, const vec &p) {
    return abs(cross(p - a.a, a.b - a.a) / abs(a.b - a.a));
}

vec cross_point(const line &a, const line &b) {
    assert(intersection(a, b) < 2);
    return a.a + (a.b - a.a) * cross(b.a - a.a, b.b - b.a) /
                     cross(a.b - a.a, b.b - b.a);
}

}  // namespace lib
#line 4 "geometry/segment.hpp"

namespace lib {

struct segment : line {};

bool intersection_segment_and_vec(const segment &a, const vec &p) {
    return isp(a.a, a.a, p) == 0;
}

bool intersection_segment(const segment &a, const segment &b) {
    if (sgn(isp(a.a, a.b, b.a) * isp(a.a, a.b, b.b)) <= 0 &&
        sgn(isp(b.a, b.b, a.a) * isp(b.a, b.b, a.b)) <= 0) {
        return true;
    } else
        return false;
}

vec cross_point(const segment &a, const segment &b) {
    assert(intersection_segment(a, b));
    return a.a + (a.b - a.a) * cross(b.a - a.a, b.b - b.a) /
                     cross(a.b - a.a, b.b - b.a);
}

ld dist(const segment &a, const vec &c) {
    if (sgn(dot(a.b - a.a, c - a.a)) <= 0) {
        return abs(c - a.a);
    } else if (sgn(dot(a.a - a.b, c - a.b)) <= 0) {
        return abs(c - a.b);
    } else {
        return abs(cross(c - a.a, a.b - a.a) / abs(a.b - a.a));
    }
}

ld dist(const segment &a, const segment &b) {
    if (intersection_segment(a, b))
        return 0;
    else
        return min(min(dist(a, b.a), dist(a, b.b)),
                   min(dist(b, a.a), dist(b, a.b)));
}

}  // namespace lib
#line 5 "test/geometry/Intersection.test.cpp"

using namespace lib;

int main() {
    int q;
    std::cin >> q;
    while (q--) {
        vec p0, p1, p2, p3;
        auto input = [](vec &p) {
            ld x, y;
            std::cin >> x >> y;
            p = {x, y};
        };
        input(p0);
        input(p1);
        input(p2);
        input(p3);
        segment s1 = {p0, p1};
        segment s2 = {p2, p3};
        int flag = intersection_segment(s1, s2);
        std::cout << flag << '\n';
    }
}