Skip to main content

Priority_queue Question 2

 Leetcode 1942 The Number of the Smallest Unoccupied Chair

There is a party where n friends numbered from 0 to n - 1 are attending. There is an infinite number of chairs in this party that are numbered from 0 to infinity. When a friend arrives at the party, they sit on the unoccupied chair with the smallest number.

For example, if chairs 0, 1, and 5 are occupied when a friend comes, they will sit on chair number 2.

When a friend leaves the party, their chair becomes unoccupied at the moment they leave. If another friend arrives at that same moment, they can sit in that chair.

You are given a 0-indexed 2D integer array times where times[i] = [arrivali, leavingi], indicating the arrival and leaving times of the ith friend respectively, and an integer targetFriend. All arrival times are distinct.

Return the chair number that the friend numbered targetFriend will sit on.

Constraints:

n == times.length

2 <= n <= 10^4

times[i].length == 2

1 <= arrivali < leavingi <= 10^5

0 <= targetFriend <= n - 1

Each arrivali time is distinct.


Analysis:

The order of the available seats is one of the keys to solve this problem.

As the friends come and leave the party, the available seats are changing dynamically. So we need to maintain a list of available seats. Since the smallest one will be picked up, the list of available seats need to be sorted. Thus, pq can be used for this purpose.

But this is not enough. When one friend comes, all the previous friends having an earlier exit time had left the party, which will generate more available seats. So we need to

1. record the data pair <exit time, occupied seat> for each friend at the party currently; 

2. if these data pair are sorted, then it will be convenient to remove the data pair having an earlier exit time.

Based on 1 & 2, a second pq can be used to store the data pairs.

To make a summary, when a friend comes to the party,

1. check the second pq, pop out all the data pair having an earlier exit time (which will generate all the available seats as well), and save the seats into the first pq;

2. if the coming time is the same as that of the targetFriend, then we just need to check the first pq. If not empty, then just pick up the first one (smallest one); if empty, need to pick up the next available seat (here we need a global variable for this);

3. if the coming time is smaller than that of the targetFriend, (since we have already done 1), we need to assign one seat to the coming friend. The way to assign the seat is the same as 2. Then store the new data pair <exit time, seat> to the second pq. And also update the first pq or the next seat if necessary.


See the code below:

public:
    typedef pair<int, int> pr;
    int smallestChair(vector<vector<int>>& times, int targetFriend) {
        int res = 0, cur = 0, tf = times[targetFriend][0];
        sort(times.begin(), times.end());
        // sorted available seats
        priority_queue<int, vector<int>, greater<int>> pq1;
        // <exit time, occupied seat>
        priority_queue<pr, vector<pr>, greater<pr>> pq2;
        for(auto &a : times) {
            // update the available seats
            while(pq2.size() && pq2.top().first <= a[0]) {
                auto t = pq2.top();
                pq2.pop();
                pq1.push(t.second);
            }
            // find and pick up the smallest available seat
            if(a[0] == tf) {
                if(pq1.size()) res = pq1.top();
                else res = cur;
                break;
            }
            // assign the smallest available seat and save
            if(pq1.size()) {
                auto t = pq1.top();
                pq1.pop();
                pq2.push({a[1], t});
            }
            else {
                pq2.push({a[1], cur++});
            }
        }
        return res;
    }
};


Upper Layer




Comments

Post a Comment

Popular posts from this blog

Segment Tree

Segment tree can be viewed as an abstract data structure which using some more space to trade for speed. For example, for a typical question with O(N^2) time complexity, the segment tree method can decrease it to O(N*log(N)).  To make it understandable, let us consider one example. Say we have an integer array of N size, and what we want is to query the maximum with a query range [idx1, idx2], where idx1 is the left indexes, and idx2 is the right indexes inclusive. If we only do this kind of query once, then we just need to scan through the array from idx1 to idx2 once, and record the maximum, done. The time complexity is O(N), which is decent enough in most cases even though it is not the optimal one (for example, with a segment tree built, the time complexity can decrease down to O(log(N))). However, how about we need to query the array N times? If we continue to use the naïve way above, then the time complexity is O(N^2), since for each query we need to scan the query range once. We
Post a Comment
Read more

Binary Search - Hard Level - Question 3

Binary Search - Hard Level - Question 3 878. Nth Magical Number A positive integer is magical if it is divisible by either a or b. Given the three integers n, a, and b, return the nth magical number. Since the answer may be very large, return it modulo 10^9 + 7. Analysis: Let us consider some examples first. Example 1, a = 4, b = 2. If b is dividable by a, then all the numbers which is dividable by a should be dividable by b as well. So the nth magical number should be n*b; Example 2, a = 3, b = 2. The multiples of 2 are: 2, 4, 6, 8, 10, 12, ... The multiple of 3 are: 3, 6, 9, 12, ... So the overlap is related to the minimum common multiple between a and b, and we need to remove the overlap which is double-counted. So now, we make some conclusions: 1. the upper bound of the nth magical number should be n*b, where a is the smaller one (or b <= a); 2. there are n*b/a magical numbers smaller than n*b; 3. there are n*b/(minimum common multiple) overlaps. Thus, the overall count is: n +
Post a Comment
Read more

Recursion - Example

Recursion - Example Leetcode 231  Power of Two Given an integer n, return true if it is a power of two. Otherwise, return false. An integer n is a power of two, if there exists an integer x such that n == 2^x Constraints: -2^31 <= n <= 2^31 - 1 Analysis: One way is to think about this question recursively: if n%2 == 1, then n must not be power of 2; if not, then we just need to consider whether (n/2) is a power of 2 or not. This is exactly the "same question with a smaller size"! It is trivial to figure out the base cases: if n == 0, return false; if n == 1, return true. See the code below: class Solution { public: bool isPowerOfTwo(int n) { // base cases if(n == 0) return false; if(n == 1) return true; // converging if(n%2 == 1) return false; return isPowerOfTwo(n/2); } }; If interested, there are some other ways to solve this problem. For example, using bit manipulation, we can have the following solution: class
Post a Comment
Read more