Submission details
Task:Point in Polygon
Sender:aalto26jm_013
Submission time:2026-11-09 16:58:26 +0200
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.04 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.01 sdetails

Compiler report

input/code.cpp: In function 'bool check_all_boundaries(const std::vector<Point>&, const Point&)':
input/code.cpp:29:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (int i = 0; i < points.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~
input/code.cpp: In function 'bool inside_polygon(const std::vector<Point>&, const Point&)':
input/code.cpp:62:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for (int i = 0; i < points.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

struct Point {
    long long x, y;

    friend istream& operator>>(istream& in, Point& p) {
        return in >> p.x >> p.y;
    }

    bool operator==(const Point & point) const {
        return x == point.x && y == point.y;
    }
};

static long long cross_product(const Point& a, const Point&b, const Point& c) {
    return (b.x-a.x)*(c.y-b.y) - (c.x-b.x)*(b.y-a.y);
}

static bool check_boundary(const Point& line_a, const Point& line_b, const Point& p) {
    return cross_product(line_a, p, line_b) == 0
    && min(line_a.x, line_b.x) <= p.x && max(line_a.x, line_b.x) >= p.x
    && min(line_a.y, line_b.y) <= p.y && max(line_a.y, line_b.y) >= p.y;
}

static bool check_all_boundaries(const vector<Point>& points, const Point& p) {
    for (int i = 0; i < points.size(); i++) {
        if (check_boundary(points[i], points[(i+1)%points.size()], p)) {
            return true;
        }
    }
    return false;
}

static bool intersects(const Point& a, const Point&b, const Point& c, const Point& d) {
    const long long ab_c = cross_product(a, b, c);
    const long long ab_d = cross_product(a, b, d);

    // Same line
    if (ab_c == 0 && ab_d == 0) {
        return max(min(a.x, b.x), min(c.x, d.x)) <= min(max(a.x, b.x), max(c.x, d.x)) &&
            max(min(a.y, b.y), min(c.y, d.y)) <= min(max(a.y, b.y), max(c.y, d.y));
    }

    // Common vertex
    if (a == c || a == d || b == c || b == d) {
        return true;
    }

    const long long cd_a = cross_product(c, d, a);
    const long long cd_b = cross_product(c, d, b);
    // One intersection
    return ((ab_c >= 0 && ab_d <= 0) || (ab_c <= 0 && ab_d >= 0)) &&
        ((cd_a >= 0 && cd_b <= 0) || (cd_a <= 0 && cd_b >= 0));
}

static bool inside_polygon(const vector<Point>& points, const Point& p) {
    long long count = 0;

    for (int i = 0; i < points.size(); i++) {
        if (intersects(points[i], points[(i+1)%points.size()], p, Point{.x = 0, .y = static_cast<int>(1e9) + 1})) {
            count++;
        }
    }

    return count % 2 != 0;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;
    cin >> n >> m;

    vector<Point> points(n);
    for (auto& p : points) {
        cin >> p;
    }

    while (m--) {
        Point p;
        cin >> p;

        if (check_all_boundaries(points, p)) {
            cout << "BOUNDARY" << endl;
            continue;
        }

        if (inside_polygon(points, p)) {
            cout << "INSIDE" << endl;
            continue;
        }

        cout << "OUTSIDE" << endl;
    }

    cout << endl;
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
100 1000
-7 -19
91 77
100 100
64 60
...

correct output
INSIDE
OUTSIDE
INSIDE
INSIDE
INSIDE
...

user output
INSIDE
OUTSIDE
INSIDE
INSIDE
INSIDE
...

Test 2

Verdict: ACCEPTED

input
1000 1000
365625896 -113418831
278762563 38777445
250367343 -96991975
175866909 -129766978
...

correct output
OUTSIDE
OUTSIDE
INSIDE
OUTSIDE
OUTSIDE
...

user output
OUTSIDE
OUTSIDE
INSIDE
OUTSIDE
OUTSIDE
...

Test 3

Verdict: ACCEPTED

input
4 1
1 5
5 5
5 1
1 1
...

correct output
INSIDE

user output
INSIDE

Test 4

Verdict: ACCEPTED

input
4 1
1 5
5 5
5 1
1 1
...

correct output
OUTSIDE

user output
OUTSIDE

Test 5

Verdict: ACCEPTED

input
4 1
1 100
2 50
1 20
0 50
...

correct output
INSIDE

user output
INSIDE

Test 6

Verdict: ACCEPTED

input
8 1
0 0
0 2
1 1
2 2
...

correct output
INSIDE

user output
INSIDE

Test 7

Verdict: ACCEPTED

input
4 4
0 0
3 0
3 4
0 4
...

correct output
INSIDE
BOUNDARY
OUTSIDE
BOUNDARY

user output
INSIDE
BOUNDARY
OUTSIDE
BOUNDARY

Test 8

Verdict: ACCEPTED

input
6 1
0 0
0 2
3 1
2 2
...

correct output
INSIDE

user output
INSIDE

Test 9

Verdict: ACCEPTED

input
3 1
0 0
1 1000000000
-3 0
1 1

correct output
OUTSIDE

user output
OUTSIDE

Test 10

Verdict: ACCEPTED

input
3 1
-100000 0
-1000000000 -999999999
1000000000 1000000000
0 0

correct output
OUTSIDE

user output
OUTSIDE

Test 11

Verdict: ACCEPTED

input
3 1
-100000 0
-999999999 -1000000000
1000 1000
0 0

correct output
INSIDE

user output
INSIDE

Test 12

Verdict: ACCEPTED

input
4 1
-4 1
-6 1
-6 -1
-4 -1
...

correct output
INSIDE

user output
INSIDE

Test 13

Verdict: ACCEPTED

input
3 1
0 10
0 -10
10 0
1 0

correct output
INSIDE

user output
INSIDE

Test 14

Verdict: ACCEPTED

input
3 1000
-536621709 -536621709
955833081 955833081
-1 1
-439278425 -439278425
...

correct output
BOUNDARY
BOUNDARY
BOUNDARY
BOUNDARY
BOUNDARY
...

user output
BOUNDARY
BOUNDARY
BOUNDARY
BOUNDARY
BOUNDARY
...