Line Segment Intersection

#include <bits/stdc++.h>
using namespace std;
 
#define I_2D(row, col, width) ((row) * (width) + (col))
#define PRINT_ARR(arr, n)                                                      \
  do {                                                                         \
    for (int i = 0; i < n; i++) {                                              \
      cout << arr[i] << " ";                                                   \
    }                                                                          \
    cout << "\n";                                                              \
  } while (0)
#define PRINT_VEC_ARR(v, n)                                                    \
  do {                                                                         \
    for (int i = 0; i < n; i++) {                                              \
      cout << i << ": ";                                                       \
      for (auto item : v[i]) {                                                 \
        cout << item << " ";                                                   \
      }                                                                        \
      cout << endl;                                                            \
    }                                                                          \
  } while (0)
 
#define endl '\n'
typedef long long ll;
typedef complex<ll> Point;
#define X real()
#define Y imag()
#define CP(a, b, c) ((conj(c - a) * (c - b)).Y)
 
bool cmp(const Point &a, const Point &b) {
  return (a.X == b.X) ? (a.Y < b.Y) : (a.X < b.X);
}
 
bool is_on_the_line(const Point a, const Point b, const Point p) {
  vector<Point> pp{a, b, p};
  sort(pp.begin(), pp.end(), cmp);
  return pp[1] == p;
}
 
int sign(ll x) { return (x > 0) - (x < 0); }
 
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t;
  cin >> t;
  int x, y;
  vector<Point> p(4);
  for (int i = 0; i < t; i++) {
    for (int j = 0; j < 4; j++) {
      cin >> x >> y;
      p[j] = {x, y};
    }
    Point a = p[0];
    Point b = p[1];
    Point c = p[2];
    Point d = p[3];
 
    ll cp1 = CP(a, b, c);
    ll cp2 = CP(a, b, d);
    ll cp3 = CP(c, d, a);
    ll cp4 = CP(c, d, b);
    if ((cp1 == 0 && is_on_the_line(a, b, c)) ||
        (cp2 == 0 && is_on_the_line(a, b, d)) ||
        (cp3 == 0 && is_on_the_line(c, d, a)) ||
        (cp4 == 0 && is_on_the_line(c, d, b))) {
      cout << "YES" << endl;
    } else if (sign(cp1) != sign(cp2) && sign(cp3) != sign(cp4)) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
 
  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED