Chef and Polygons

CodeChefRating 2778Open on judge ↗

Chef is not very good with geometric problems, and he, therefore, asks you to solve one of them. He has N red points and M black points, and Q queries on them. In each query, he will give you a subset of red points, you have to find out number of black points lying strictly inside the convex polygon formed by using the given subset as vertices. Input The first line of input contains two integers

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI