855. Exam Room

855. Exam Room (Medium)

In an exam room, there are N seats in a single row, numbered 0, 1, 2, ..., N-1.

When a student enters the room, they must sit in the seat that maximizes the distance to the closest person.  If there are multiple such seats, they sit in the seat with the lowest number.  (Also, if no one is in the room, then the student sits at seat number 0.)

Return a class ExamRoom(int N) that exposes two functions: ExamRoom.seat() returning an int representing what seat the student sat in, and ExamRoom.leave(int p) representing that the student in seat number p now leaves the room.  It is guaranteed that any calls to ExamRoom.leave(p) have a student sitting in seat p.

 

Example 1:

Input: ["ExamRoom","seat","seat","seat","seat","leave","seat"], [[10],[],[],[],[],[4],[]]
Output: [null,0,9,4,2,null,5]
Explanation:
ExamRoom(10) -> null
seat() -> 0, no one is in the room, then the student sits at seat number 0.
seat() -> 9, the student sits at the last seat number 9.
seat() -> 4, the student sits at the last seat number 4.
seat() -> 2, the student sits at the last seat number 2.
leave(4) -> null
seat() -> 5, the student sits at the last seat number 5.

​​​​​​​

Note:

1. 1 <= N <= 10^9
2. ExamRoom.seat() and ExamRoom.leave() will be called at most 10^4 times across all test cases.
3. Calls to ExamRoom.leave(p) are guaranteed to have a student currently sitting in seat number p.

Related Topics:
Ordered Map

Similar Questions:

• Maximize Distance to Closest Person (Medium)

Solution 1.

// OJ: https://leetcode.com/problems/exam-room/
// Author: github.com/lzl124631x
// Time:
//      ExamRoom: O(1)
//      seat: O(N)
//      leave: O(logN)
// Space: O(N)
class ExamRoom {
    set<int> s;
    int N;
public:
    ExamRoom(int N) : N(N) {}
    int seat() {
        if (s.empty()) {
            s.insert(0);
            return 0;
        }
        int prev = -1, ans = 0, dist = 0;
        for (int i : s) {
            if (prev == -1) dist = i;
            else {
                int d = (i - prev) / 2;
                if (d > dist) {
                    dist = d;
                    ans = (i + prev) / 2;
                }
            }
            prev = i;
        }
        if (N - 1 - prev > dist) ans = N - 1;
        s.insert(ans);
        return ans;
    }
    void leave(int p) {
        s.erase(p);
    }
};