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

Code

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long long getCrossProduct(pair<long long, long long> p, pair<long long, long long> a, pair<long long, long long> b){
    return (p.second - a.second) * (b.first - a.first) - (p.first - a.first) * (b.second - a.second);
}

// Is on segment?
bool onSegment(pair<long long, long long> p, pair<long long, long long> a, pair<long long, long long> b) {
    // In bounds?
    if (min(a.first, b.first) <= p.first && max(a.first, b.first) >= p.first && min(a.second, b.second) <= p.second && max(a.second, b.second) >= p.second) {
        long long cross = getCrossProduct(p, a, b);
        
        if (cross == 0) return true;
    
    }
    return false;
}

int main() {

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

    // Check pair
    vector<pair<long long, long long>> polygon(n);

    for (int i = 0; i < n; i++) {
        cin >> polygon[i].first >> polygon[i].second;
    }

    vector<pair<long long, long long>> points(m);
    for (int i = 0; i < m; i++) {
        cin >> points[i].first >> points[i].second;
    }

    for (int p = 0; p < m; p++) { // For every point...
        long long px, py;
        px = points[p].first;
        py = points[p].second;

        bool onBoundary = false;
        // Count intersections for rays
        int intersections = 0;

        for (int i = 0; i < n; i++) { // For every line...
            long long ax = polygon[i].first;
            long long ay = polygon[i].second;
            long long bx = polygon[(i + 1) % n].first;
            long long by = polygon[(i + 1) % n].second;
            
            // Segment
            if (onSegment({px, py}, {ax, ay}, {bx, by})) {
                onBoundary = true;
                break;
            }

            // Raycast
            if ((ay > py) != (by > py)) {
                
                long long cross = getCrossProduct({px, py}, {ax, ay}, {bx, by});
                // Check if point intersects line.
                if (by > ay) {
                    if (cross > 0) intersections++;
                } else {
                    if (cross < 0) intersections++;
                }
            }
        }

        // OUTPUT

        if (onBoundary) {
            cout << "BOUNDARY\n";

        } else if (intersections % 2 == 1) {
            cout << "INSIDE\n";

        } else {
            cout << "OUTSIDE\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
...