Line Segment Intersection

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;

struct pt{ ll x; ll y; };
pt operator+(const pt& a, const pt& b){ return pt{.x=a.x+b.x, .y=a.y+b.y}; };
pt operator-(const pt& a, const pt& b){ return pt{.x=a.x-b.x, .y=a.y-b.y}; };
bool operator==(const pt& a, const pt& b){ return a.x == b.x && a.y == b.y; };
ostream& operator<<(ostream& os, const pt& a){ return os << "(" << a.x << "," << a.y << ")"; }
ll cross(pt p1, pt p2){
    return p1.x*p2.y - p1.y*p2.x;
}
ll orient(pt a, pt b, pt c) {
    return cross(b-a, c-a);
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    ull t;
    cin >> t;

    for(ull i=0; i<t; i++){
        pt p1, p2, p3, p4;
        cin >> p1.x >> p1.y >> p2.x >> p2.y >> p3.x >> p3.y >> p4.x >> p4.y;

        ll cp1 = orient(p3,p4,p1);
        ll cp2 = orient(p3,p4,p2);
        ll cp3 = orient(p1,p2,p3);
        ll cp4 = orient(p1,p2,p4);

        bool inter = ((((cp1>0)==(cp2<=0))) && (((cp3>0)==(cp4<=0)))) || ((cp1 == 0 || cp2 == 0) && (cp3 == 0 || cp4 == 0)) || p1 == p3 || p2 == p3 || p1 == p4 || p2 == p4;
        // cout << p1 << " " << p2 << " " << p3 << " " << p4 << " " << inter << "\n";
        cout << (inter ? "YES\n" : "NO\n");
    }
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED