This Problem: The Delicious Cake is from June Long Challenge Div 2. I’ve tried solving it using Python3.6 and got 15 Pts. with lot of TLE’s, so, I tried solving the same problem using c++. But It gives WA on some cases and TLE on others.

I’ve implemented the same logic in both but got different results. I first found the Convex hull for all points and then removed the points forming the convex hull from the original list of Points and added it to the list of all polygons, and repeated the same till all possible polygons are made. And then, for each query, I checked inside how many polygons the candle lies. I’ve also covered the case when a point lies on edge of a polygon.

**I am a beginner in C++** and don’t know how to use it properly for CP. Can anyone please tell me what’s wrong with this C++ code? Any help will be appreciated. Thanks