Submission details
Task:Point in Polygon
Sender:aalto26jm_011
Submission time:2026-11-09 17:45:55 +0200
Language:C++ (C++20)
Status:READY
Result:
Test results
testverdicttime
#10.01 sdetails
#20.02 sdetails
#30.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#60.00 sdetails
#7ACCEPTED0.00 sdetails
#80.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#110.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails

Code

#include <bits/stdc++.h>

using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef long long ll;
typedef long long C;
typedef complex<C> P;
#define X real()
#define Y imag()
#define FAST                                                                   \
    ios::sync_with_stdio(0);                                                   \
    cin.tie(0);

ll cross(P a, P b) { return a.X * b.Y - a.Y * b.X; }
int sgn(ll x) { return (x > 0) - (x < 0); }

// does segment [a,b] intersect segment [c,d]? (touching counts)
bool intersects(P a, P b, P c, P d) {
    int o1 = sgn(cross(b - a, c - a));
    int o2 = sgn(cross(b - a, d - a));
    int o3 = sgn(cross(d - c, a - c));
    int o4 = sgn(cross(d - c, b - c));

    if (o1 == 0 && o2 == 0 && o3 == 0 && o4 == 0) {
        // fully collinear (or degenerate): compare 1D ranges on both axes
        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));
    }
    return o1 * o2 <= 0 && o3 * o4 <= 0;
}

C pointLocToLine(P point, P line1, P line2) {
    return cross(point - line1, point - line2);
}

bool isPointOnLine(P point, P line1, P line2) {
    return pointLocToLine(point, line1, line2) == 0;
}

int main() {
    FAST;

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

    vector<P> poly(n + 1);

    for (int i = 0; i < n; i++) {
        C x, y;
        cin >> x >> y;
        poly[i] = {x, y};
    }
    poly[n] = poly[0];

    vector<P> p(m);
    for (int i = 0; i < m; i++) {
        C x, y;
        cin >> x >> y;
        p[i] = {x, y};
    }

    P far = {10000000000, 10000000000};
    for (P point : p) {
        int cnt = 0;
        bool done = false;
        for (int i = 0; i < n; i++) {

            if (isPointOnLine(point, poly[i], poly[i + 1])) {
                cout << "BOUNDARY\n";
                done = true;
                break;
            }

            if (intersects(point, far, poly[i], poly[i + 1]))
                cnt++;
        }

        if (done)
            continue;

        if (cnt % 2 == 0)
            cout << "OUTSIDE\n";
        else
            cout << "INSIDE\n";
    }

    return 0;
}

Test details

Test 1

Verdict:

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
...

Feedback: Incorrect character on line 10 col 1: expected "OUTSIDE", got "BOUNDARY"

Test 2

Verdict:

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

correct output
OUTSIDE
OUTSIDE
INSIDE
OUTSIDE
OUTSIDE
...

user output
OUTSIDE
INSIDE
INSIDE
INSIDE
OUTSIDE
...

Feedback: Incorrect character on line 2 col 1: expected "OUTSIDE", got "INSIDE"

Test 3

Verdict:

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

correct output
INSIDE

user output
OUTSIDE

Feedback: Incorrect character on line 1 col 1: expected "INSIDE", got "OUTSIDE"

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:

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

correct output
INSIDE

user output
BOUNDARY

Feedback: Incorrect character on line 1 col 1: expected "INSIDE", got "BOUNDARY"

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:

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

correct output
INSIDE

user output
OUTSIDE

Feedback: Incorrect character on line 1 col 1: expected "INSIDE", got "OUTSIDE"

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:

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

correct output
INSIDE

user output
OUTSIDE

Feedback: Incorrect character on line 1 col 1: expected "INSIDE", got "OUTSIDE"

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
...