CF70D Professor's task

Once a walrus professor Plato asked his programming students to perform the following practical task. The students had to implement such a data structure that would support a convex hull on some set of points $ S $ . The input to the program had $ q $ queries of two types: 1\. Add a point with coordinates $ (x,y) $ into the set $ S $ . Note that in this case the convex hull of $ S $ could have changed, and could have remained the same. 2\. Say whether a point with coordinates $ (x,y) $ belongs to an area limited by the convex hull, including the border. All the students coped with the task. What about you?

N/A

N/A