Point in Polygon

n, m = [int(x) for x in input().split()]

polygon = []
for _ in range(n):
    x, y = [int(x) for x in input().split()]
    polygon.append((x, y))

def cross_product(a, b):
    return a[0]*b[1] - a[1]*b[0]

def dans_polygon(point) -> bool:
    """
    Permet de savoir si le polygon 1 est dans le polygon 2
    Cimer Emile
    """
    est_dans_pol = False
    for i in range(n):
        p0 = polygon[i]
        p1 = polygon[(i+1)%n]
        crossprod_point = cross_product((point[0]-p0[0], point[1]-p0[1]), (point[0]-p1[0], point[1]-p1[1]))
        if crossprod_point == 0:
            return True, True
        if min(p1[0],p0[0]) <= point[0] < max(p1[0],p0[0]):
            coef_dir = (p0[1] - p1[1])/(p0[0]- p1[0])
            coef_b = p0[1] - p0[0] * coef_dir
            if point[1] >= (point[0]*coef_dir + coef_b):
                est_dans_pol = not est_dans_pol
    return est_dans_pol, False

res = []
for _ in range(m):
    x, y = [int(x) for x in input().split()]
    loc_res = dans_polygon((x, y))
    if loc_res[0]:
        if loc_res[1]:
            res.append("BOUNDARY")
        else:
            res.append("INSIDE")
    else:
        res.append("OUTSIDE")

for elt in res:
    print(elt)

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: UNKNOWN