1606. Find Servers That Handled Most Number of Requests Hard

1/**
2 * [1606] Find Servers That Handled Most Number of Requests
3 *
4 * You have k servers numbered from 0 to k-1 that are being used to handle multiple requests simultaneously. Each server has infinite computational capacity but cannot handle more than one request at a time. The requests are assigned to servers according to a specific algorithm:
5 * 
6 * 	The i^th (0-indexed) request arrives.
7 * 	If all servers are busy, the request is dropped (not handled at all).
8 * 	If the (i % k)^th server is available, assign the request to that server.
9 * 	Otherwise, assign the request to the next available server (wrapping around the list of servers and starting from 0 if necessary). For example, if the i^th server is busy, try to assign the request to the (i+1)^th server, then the (i+2)^th server, and so on.
10 * 
11 * You are given a strictly increasing array arrival of positive integers, where arrival[i] represents the arrival time of the i^th request, and another array load, where load[i] represents the load of the i^th request (the time it takes to complete). Your goal is to find the busiest server(s). A server is considered busiest if it handled the most number of requests successfully among all the servers.
12 * Return a list containing the IDs (0-indexed) of the busiest server(s). You may return the IDs in any order.
13 *  
14 * Example 1:
15 * <img alt="" src="https://assets.leetcode.com/uploads/2020/09/08/load-1.png" style="width: 389px; height: 221px;" />
16 * Input: k = 3, arrival = [1,2,3,4,5], load = [5,2,3,3,3] 
17 * Output: [1] 
18 * Explanation: 
19 * All of the servers start out available.
20 * The first 3 requests are handled by the first 3 servers in order.
21 * Request 3 comes in. Server 0 is busy, so it's assigned to the next available server, which is 1.
22 * Request 4 comes in. It cannot be handled since all servers are busy, so it is dropped.
23 * Servers 0 and 2 handled one request each, while server 1 handled two requests. Hence server 1 is the busiest server.
24 * 
25 * Example 2:
26 * 
27 * Input: k = 3, arrival = [1,2,3,4], load = [1,2,1,2]
28 * Output: [0]
29 * Explanation: 
30 * The first 3 requests are handled by first 3 servers.
31 * Request 3 comes in. It is handled by server 0 since the server is available.
32 * Server 0 handled two requests, while servers 1 and 2 handled one request each. Hence server 0 is the busiest server.
33 * 
34 * Example 3:
35 * 
36 * Input: k = 3, arrival = [1,2,3], load = [10,12,11]
37 * Output: [0,1,2]
38 * Explanation: Each server handles a single request, so they are all considered the busiest.
39 * 
40 *  
41 * Constraints:
42 * 
43 * 	1 <= k <= 10^5
44 * 	1 <= arrival.length, load.length <= 10^5
45 * 	arrival.length == load.length
46 * 	1 <= arrival[i], load[i] <= 10^9
47 * 	arrival is strictly increasing.
48 * 
49 */
50pub struct Solution {}
51
52// problem: https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests/
53// discuss: https://leetcode.com/problems/find-servers-that-handled-most-number-of-requests/discuss/?currentPage=1&orderBy=most_votes&query=
54
55// submission codes start here
56
57impl Solution {
58    pub fn busiest_servers(k: i32, arrival: Vec<i32>, load: Vec<i32>) -> Vec<i32> {
59        vec![]
60    }
61}
62
63// submission codes end
64
65#[cfg(test)]
66mod tests {
67    use super::*;
68
69    #[test]
70    fn test_1606() {
71    }
72}
73