Point in Polygon

#include <bits/stdc++.h>
using namespace std;

struct Point {
    long long x, y;
};

bool onSegment(Point a, Point b, Point p) {
    return p.x <= max(a.x, b.x) && p.x >= min(a.x, b.x) &&
           p.y <= max(a.y, b.y) && p.y >= min(a.y, b.y);
}

// Find the orientation of the triplet (a, b, c)
// 0 -> a, b and c are collinear
// 1 -> Clockwise
// 2 -> Counterclockwise
int orientation(Point a, Point b, Point c) {
    long long val = (b.y - a.y) * (c.x - b.x) - (b.x - a.x) * (c.y - b.y);
    if (val == 0) return 0;
    return (val > 0) ? 1 : 2;
}

// Check if two line segments intersect
bool doIntersect(Point a, Point b, Point c, Point d) {
    int o1 = orientation(a, b, c);
    int o2 = orientation(a, b, d);
    int o3 = orientation(c, d, a);
    int o4 = orientation(c, d, b);

    if (o1 != o2 && o3 != o4) return true;

    if (o1 == 0 && onSegment(a, b, c)) return true;
    if (o2 == 0 && onSegment(a, b, d)) return true;
    if (o3 == 0 && onSegment(c, d, a)) return true;
    if (o4 == 0 && onSegment(c, d, b)) return true;

    return false;
}

// Check if a point is inside a polygon
string pointInPolygon(Point point, const vector<Point>& polygon) {
    int n = polygon.size();
    Point extreme = {LLONG_MAX, point.y};
    int count = 0;

    for (int i = 0; i < n; i++) {
        Point next = polygon[(i + 1) % n];

        if (doIntersect(polygon[i], next, point, extreme)) {
            if (orientation(polygon[i], next, point) == 0 && onSegment(polygon[i], next, point))
                return "BOUNDARY";
            count++;
        }
    }

    return (count % 2 == 1) ? "INSIDE" : "OUTSIDE";
}

int main() {
    int n, m;
    cin >> n >> m;
    vector<Point> polygon(n);
    vector<Point> test_points(m);
    
    for (int i = 0; i < n; i++) {
        cin >> polygon[i].x >> polygon[i].y;
    }

    for (int i = 0; i < m; i++) {
        cin >> test_points[i].x >> test_points[i].y;
    }
    
    
    for (int i = 0; i < m; i++) {
        Point p = test_points[i];
        cout << pointInPolygon(p, polygon) << endl;
    }

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED