Submission details
Task:Point in Polygon
Sender:aalto26jm_011
Submission time:2026-11-09 18:33:31 +0200
Language:C++ (C++20)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.01 sdetails
#2ACCEPTED0.01 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.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); }

// is point p on segment [a,b]?
bool onSegment(P p, P a, P b) {
    return cross(a - p, b - p) == 0 && min(a.X, b.X) <= p.X &&
           p.X <= max(a.X, b.X) && min(a.Y, b.Y) <= p.Y &&
           p.Y <= max(a.Y, b.Y);
}

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

    for (P point : p) {
        int cnt = 0;
        bool boundary = false;
        for (int i = 0; i < n; i++) {
            P a = poly[i], b = poly[i + 1];

            if (onSegment(point, a, b)) {
                boundary = true;
                break;
            }

            // edge crosses the horizontal line y = point.Y (half-open rule)
            if ((a.Y > point.Y) != (b.Y > point.Y)) {
                C c = cross(b - a, point - a);
                // crossing is to the right of point
                if ((b.Y > a.Y) == (c > 0))
                    cnt++;
            }
        }

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

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