Submission details
Task:Point in Polygon
Sender:aalto26jm_014
Submission time:2026-11-09 17:38:07 +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
#70.00 sdetails
#80.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#130.00 sdetails
#14ACCEPTED0.00 sdetails

Code

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

// debug
template<class T> ostream& operator<<(ostream&, const vector<T>&);
template<class T> ostream& operator<<(ostream&, const set<T>&);
template<class T> ostream& operator<<(ostream&, const multiset<T>&);
template<class K, class V> ostream& operator<<(ostream&, const map<K, V>&);
template<class T, size_t N> ostream& operator<<(ostream&, const array<T, N>&);
template<class A, class B> ostream& operator<<(ostream& os, const pair<A, B>& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template<class T>
void print_collection(ostream& os, const T& v) {
    os << "{";
    bool first = true;
    for (const auto& x : v) {
        if (!first) os << ", ";
        first = false;
        os << x;
    }
    os << "}";
}
template<class T> ostream& operator<<(ostream& os, const vector<T>& v) { print_collection(os, v); return os; }
template<class T> ostream& operator<<(ostream& os, const set<T>& v) { print_collection(os, v); return os; }
template<class T> ostream& operator<<(ostream& os, const multiset<T>& v) { print_collection(os, v); return os; }
template<class K, class V> ostream& operator<<(ostream& os, const map<K, V>& v) { print_collection(os, v); return os; }
template<class T, size_t N> ostream& operator<<(ostream& os, const array<T, N>& v) { print_collection(os, v); return os; }
#define dbg(x) cerr << #x << " = " << (x) << '\n'

using ll = long long;
constexpr int INF = 1'000'000'000; // 1e9
constexpr ll LINF = 1'000'000'000'000'000'000LL; // 1e18
constexpr int MOD = 1'000'000'007; // 1e9 + 7

inline ll add(ll a, ll b) { return (a + b) % MOD; }
inline ll sub(ll a, ll b) { return ((a - b) % MOD + MOD) % MOD; }
inline ll mul(ll a, ll b) { return (a * b) % MOD; }

#define X real()
#define Y imag()

ll crossProduct(complex<ll> a, complex<ll>b) {
    return (conj(a)*b).Y;
}

int intersect(complex<ll> p, complex<ll> s1, complex<ll> s2) {
    ll a = crossProduct(p-s1, p-s2);
    return a == 0 ? 0 : (a>0 ? 1 : -1);
}

void solve() {
    int N, M;
    cin >> N >> M;

    vector<complex<ll>> p(N+1);
    ll x,y;
    for(int i=0;i<N;++i) {
        cin >> x >> y;
        p[i] = {x,y};
    }
    p[N]=p[0];

    ll rayx,rayy = 0;
    for(int i = 0; i<M; i++) {
        cin >> x >> y;

        rayx = x==0 ? 1 : 0;
        complex<ll> ray = {rayx,rayy}, point = {x,y};

        int touched = 0;
        for(int j=0;j<N;j++) {
            if((p[j].X == x && p[j].Y ==y) || (intersect(point, p[j], p[j+1]) == 0 && min(p[j].X,p[j+1].X) <= x && x <= max(p[j].X,p[j+1].X) && min(p[j].Y,p[j+1].Y) <= y && y <= max(p[j].Y,p[j+1].Y))) {
                touched = -1;
                break;
            }

            if(p[j]==ray||p[j]==point||p[j+1]==ray||p[j+1]==point) {
                touched++;
                continue;
            }
            
            int a = intersect(point, p[j], p[j+1]);
            int b = intersect(ray, p[j], p[j+1]);
            int c = intersect(p[j], point, ray);
            int d = intersect(p[j+1], point, ray);
            if(a!=0&&b!=0&&c!=0&&d!=0&&a!=b&&c!=d) touched++;
        }
        if(touched==-1) {
            cout << "BOUNDARY\n";
            continue;
        }
        cout << ((touched % 2) == 0 ? "OUTSIDE\n" : "INSIDE\n");
    }
    
}

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

    solve();

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

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

Test 2

Verdict:

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

correct output
OUTSIDE
OUTSIDE
INSIDE
OUTSIDE
OUTSIDE
...

user output
INSIDE
INSIDE
OUTSIDE
INSIDE
INSIDE
...

Feedback: Incorrect character on line 1 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
OUTSIDE

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

Test 7

Verdict:

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

correct output
INSIDE
BOUNDARY
OUTSIDE
BOUNDARY

user output
OUTSIDE
BOUNDARY
INSIDE
BOUNDARY

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

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

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

correct output
INSIDE

user output
OUTSIDE

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

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