Line Intersections

#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;
}

//Is c between a and b?
bool between(po a,po b,po c){
    return c.X <= max(a.X,b.X) && c.X >= min(a.X,b.X) && c.Y <= max(a.Y,b.Y) && c.Y >= min(a.Y,b.Y);
}

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){
        //Quicker Writing
        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){
            if(between(a,b,c) || between(a,b,d) || between(c,d,a) || between(c,d,b)){
                res[i] = true;
                continue;
            }
        }

        //Second case:
        if ((a==c) || (b==c) || (a==d) || (b==d)){
            res[i] = true;
            continue;
        }

        //Third case:
        ll c1 = cross(c-a,c-b);
        ll c2 = cross(d-a,d-b);
        ll c3 = cross(a-c,a-d);
        ll c4 = cross(b-c,b-d);
        if(c1*c2 < 0 && c3*c4 < 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: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: WRONG ANSWER

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER