Exam Room

Manage an exam room of n seats where seat() places the next student at the index that maximizes the distance to the nearest occupied seat (ties broken by smallest index) and leave(p) frees a seat. The challenge is to design a data structure—typically interval tracking with a max-heap and ordered set—to pick and merge the largest empty segments efficiently for up to 10^4 operations with n up to 10^9.