Add problem 1882: Process Tasks Using Servers

src/lib.rs

@@ -1402,6 +1402,7 @@ pub mod problem_1877_minimize_maximum_pair_sum_in_array;
 pub mod problem_1879_minimum_xor_sum_of_two_arrays;
 pub mod problem_1880_check_if_word_equals_summation_of_two_words;
 pub mod problem_1881_maximum_value_after_insertion;
+pub mod problem_1882_process_tasks_using_servers;
 pub mod problem_1884_egg_drop_with_2_eggs_and_n_floors;
 pub mod problem_1886_determine_whether_matrix_can_be_obtained_by_rotation;
 pub mod problem_1887_reduction_operations_to_make_the_array_elements_equal;

src/problem_1882_process_tasks_using_servers/binary_heap.rs

@@ -0,0 +1,60 @@
+pub struct Solution;
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+use std::cmp::Reverse;
+use std::collections::BinaryHeap;
+
+impl Solution {
+    pub fn assign_tasks(servers: Vec<i32>, tasks: Vec<i32>) -> Vec<i32> {
+        let mut idle_servers = (0_u32..)
+            .zip(servers)
+            .map(|(index, weight)| Reverse((weight as u32, index)))
+            .collect::<BinaryHeap<_>>();
+
+        let mut busy_servers = BinaryHeap::with_capacity(idle_servers.len());
+        let mut tasks = tasks;
+
+        for (time, target) in (0_u32..).zip(&mut tasks) {
+            while let Some(&Reverse((idle_time, weight, index))) = busy_servers.peek() {
+                if idle_time <= time {
+                    busy_servers.pop();
+                    idle_servers.push(Reverse((weight, index)));
+                } else {
+                    break;
+                }
+            }
+
+            *target = (if let Some(Reverse((weight, index))) = idle_servers.pop() {
+                busy_servers.push(Reverse((time + *target as u32, weight, index)));
+
+                index
+            } else {
+                let mut busy_server = busy_servers.peek_mut().unwrap();
+                let busy_server = &mut busy_server.0;
+
+                busy_server.0 += *target as u32;
+
+                busy_server.2
+            }) as _;
+        }
+
+        tasks
+    }
+}
+
+// ------------------------------------------------------ snip ------------------------------------------------------ //
+
+impl super::Solution for Solution {
+    fn assign_tasks(servers: Vec<i32>, tasks: Vec<i32>) -> Vec<i32> {
+        Self::assign_tasks(servers, tasks)
+    }
+}
+
+#[cfg(test)]
+mod tests {
+    #[test]
+    fn test_solution() {
+        super::super::tests::run::<super::Solution>();
+    }
+}

src/problem_1882_process_tasks_using_servers/mod.rs

@@ -0,0 +1,57 @@
+pub mod binary_heap;
+
+pub trait Solution {
+    fn assign_tasks(servers: Vec<i32>, tasks: Vec<i32>) -> Vec<i32>;
+}
+
+#[cfg(test)]
+mod tests {
+    use super::Solution;
+
+    pub fn run<S: Solution>() {
+        let test_cases = [
+            (
+                (&[3, 3, 2] as &[_], &[1, 2, 3, 2, 1, 2] as &[_]),
+                &[2, 2, 0, 2, 1, 2] as &[_],
+            ),
+            ((&[5, 1, 4, 3, 2], &[2, 1, 2, 4, 5, 2, 1]), &[1, 4, 1, 4, 1, 3, 2]),
+            (
+                (
+                    &[
+                        338, 890, 301, 532, 284, 930, 426, 616, 919, 267, 571, 140, 716, 859, 980, 469, 628, 490, 195,
+                        664, 925, 652, 503, 301, 917, 563, 82, 947, 910, 451, 366, 190, 253, 516, 503, 721, 889, 964,
+                        506, 914, 986, 718, 520, 328, 341, 765, 922, 139, 911, 578, 86, 435, 824, 321, 942, 215, 147,
+                        985, 619, 865,
+                    ],
+                    &[
+                        773, 537, 46, 317, 233, 34, 712, 625, 336, 221, 145, 227, 194, 693, 981, 861, 317, 308, 400, 2,
+                        391, 12, 626, 265, 710, 792, 620, 416, 267, 611, 875, 361, 494, 128, 133, 157, 638, 632, 2,
+                        158, 428, 284, 847, 431, 94, 782, 888, 44, 117, 489, 222, 932, 494, 948, 405, 44, 185, 587,
+                        738, 164, 356, 783, 276, 547, 605, 609, 930, 847, 39, 579, 768, 59, 976, 790, 612, 196, 865,
+                        149, 975, 28, 653, 417, 539, 131, 220, 325, 252, 160, 761, 226, 629, 317, 185, 42, 713, 142,
+                        130, 695, 944, 40, 700, 122, 992, 33, 30, 136, 773, 124, 203, 384, 910, 214, 536, 767, 859,
+                        478, 96, 172, 398, 146, 713, 80, 235, 176, 876, 983, 363, 646, 166, 928, 232, 699, 504, 612,
+                        918, 406, 42, 931, 647, 795, 139, 933, 746, 51, 63, 359, 303, 752, 799, 836, 50, 854, 161, 87,
+                        346, 507, 468, 651, 32, 717, 279, 139, 851, 178, 934, 233, 876, 797, 701, 505, 878, 731, 468,
+                        884, 87, 921, 782, 788, 803, 994, 67, 905, 309, 2, 85, 200, 368, 672, 995, 128, 734, 157, 157,
+                        814, 327, 31, 556, 394, 47, 53, 755, 721, 159, 843,
+                    ],
+                ),
+                &[
+                    26, 50, 47, 11, 56, 31, 18, 55, 32, 9, 4, 2, 23, 53, 43, 0, 44, 30, 6, 51, 29, 51, 15, 17, 22, 34,
+                    38, 33, 42, 3, 25, 10, 49, 51, 7, 58, 16, 21, 19, 31, 19, 12, 41, 35, 45, 52, 13, 59, 47, 36, 1,
+                    28, 48, 39, 24, 8, 46, 20, 5, 54, 27, 37, 14, 57, 40, 59, 8, 45, 4, 51, 47, 7, 58, 4, 31, 23, 54,
+                    7, 9, 56, 2, 46, 56, 1, 17, 42, 11, 30, 12, 44, 14, 32, 7, 10, 23, 1, 29, 27, 6, 10, 33, 24, 19,
+                    10, 35, 30, 35, 10, 17, 49, 50, 36, 29, 1, 48, 44, 7, 11, 24, 57, 42, 30, 10, 55, 3, 20, 38, 15, 7,
+                    46, 32, 21, 40, 16, 59, 30, 53, 17, 18, 22, 51, 11, 53, 36, 57, 26, 5, 36, 56, 55, 31, 34, 57, 7,
+                    52, 37, 31, 10, 0, 51, 41, 2, 32, 25, 0, 7, 49, 47, 13, 14, 24, 57, 28, 4, 45, 43, 39, 38, 8, 2,
+                    44, 45, 29, 25, 25, 12, 54, 5, 44, 30, 27, 23, 26, 7, 33, 58, 41, 25, 52, 40, 58, 9, 52, 40,
+                ],
+            ),
+        ];
+
+        for ((servers, tasks), expected) in test_cases {
+            assert_eq!(S::assign_tasks(servers.to_vec(), tasks.to_vec()), expected);
+        }
+    }
+}