Line Segment Intersection

#include <bits/stdc++.h>

using namespace std;

//Definitions for quicker writing
#define REP(i,a,b) for (int i = a; i < b; i++)
#define clz __builtin_clz
#define ctz __builtin_ctz
#define popct __builtin_popcount
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define X real()
#define Y imag()

//Typedefs for quicker writing
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef pair<int,int> pi;
typedef pair<long long, long long> pl;
typedef complex<long long> po;

//Max values
const long long lmx = LLONG_MAX;
const int imx = INT_MAX;

ll cross(po v, po w){
    return v.X * w.Y - v.Y * w.X;
}

int main() {
	//IO optimization
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	//Input definition
	ll n;

	//Read In
	cin >> n;

    po tests[n][4];
    ll x;
    ll y;
    REP(i,0,n){
        REP(j,0,4){
            cin >> x >> y;
            tests[i][j] = {x,y};
        }
    }

	//Main part
    vector<bool> res(n,false);
    po a;
    po b;
    po c;
    po d;
	REP(i,0,n){
        //Dont wanna write tests[x][y] everytime
        a = tests[i][0];
        b = tests[i][1];
        c = tests[i][2];
        d = tests[i][3];
        //First case:
        if(cross(b-a,d-c) == 0 && cross(c-a,c-b) == 0 && cross(d-a,d-b) == 0){
            vl x1 = {a.X,b.X}, x2 = {c.X,d.X};
            vl y1 = {a.Y,b.Y}, y2 = {c.Y,d.Y};
            sort(x1.begin(), x1.end());
            sort(x2.begin(), x2.end());
            sort(y1.begin(), y1.end());
            sort(y2.begin(), y2.end());
            if(x1[1] >= x2[0] && x1[0] <= x2[1] && y1[1] >= y2[0] && y1[0] <= y2[1]){
                res[i] = true;
                continue;
            }
        }

        //Second case:
        if ((a==c) || (b==c) || (a==d) || (b==d)){
            res[i] = true;
            continue;
        }
        //cout << i << ":    " << cross(c-a,c-b) << " " << cross(d-a,d-b) << " " << cross(a-c,a-d) << " " << cross(b-c,b-d) << "\n";
        //Third case:
        if(((cross(c-a,c-b) > 0 && cross(d-a,d-b) < 0) ||
            (cross(c-a,c-b) < 0 && cross(d-a,d-b) > 0)) &&
           ((cross(a-c,a-d) > 0 && cross(b-c,b-d) < 0) || 
            (cross(a-c,a-d) < 0 && cross(b-c,b-d) > 0 ))){
            res[i] = true;
        }
    }
	
	//Write out
    REP(i,0,n){
        cout << (res[i] ? "YES" : "NO") << "\n";
    }
		
	//Return
	return 0;

}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: ACCEPTED