| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.MaximumNumberOfTasksYouCanAssign; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MaximumNumberOfTasksYouCanAssignLinkedList : IMaximumNumberOfTasksYouCanAssign |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n log n + m log m + min(n, m) × log(min(n, m))) |
| | | 19 | | /// Space complexity - O(min(n, m)) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="tasks"></param> |
| | | 22 | | /// <param name="workers"></param> |
| | | 23 | | /// <param name="pills"></param> |
| | | 24 | | /// <param name="strength"></param> |
| | | 25 | | /// <returns></returns> |
| | | 26 | | public int MaxTaskAssign(int[] tasks, int[] workers, int pills, int strength) |
| | 4 | 27 | | { |
| | 4 | 28 | | Array.Sort(tasks); |
| | 4 | 29 | | Array.Sort(workers); |
| | | 30 | | |
| | 4 | 31 | | var left = 0; |
| | 4 | 32 | | var right = Math.Min(tasks.Length, workers.Length); |
| | 4 | 33 | | var result = 0; |
| | | 34 | | |
| | 15 | 35 | | while (left <= right) |
| | 11 | 36 | | { |
| | 11 | 37 | | var mid = left + ((right - left) / 2); |
| | | 38 | | |
| | 11 | 39 | | if (CanComplete(tasks, workers, pills, strength, mid)) |
| | 8 | 40 | | { |
| | 8 | 41 | | result = mid; |
| | | 42 | | |
| | 8 | 43 | | left = mid + 1; |
| | 8 | 44 | | } |
| | | 45 | | else |
| | 3 | 46 | | { |
| | 3 | 47 | | right = mid - 1; |
| | 3 | 48 | | } |
| | 11 | 49 | | } |
| | | 50 | | |
| | 4 | 51 | | return result; |
| | 4 | 52 | | } |
| | | 53 | | |
| | | 54 | | private static bool CanComplete(int[] tasks, int[] workers, int pills, int strength, int k) |
| | 11 | 55 | | { |
| | 11 | 56 | | if (k == 0) |
| | 0 | 57 | | { |
| | 0 | 58 | | return true; |
| | | 59 | | } |
| | | 60 | | |
| | 11 | 61 | | if (k > workers.Length) |
| | 0 | 62 | | { |
| | 0 | 63 | | return false; |
| | | 64 | | } |
| | | 65 | | |
| | 11 | 66 | | var linkedList = new LinkedList<int>(); |
| | 11 | 67 | | var workerIndex = workers.Length - 1; |
| | 11 | 68 | | var usedPills = 0; |
| | | 69 | | |
| | 56 | 70 | | for (var i = k - 1; i >= 0; i--) |
| | 20 | 71 | | { |
| | 40 | 72 | | while (workerIndex >= workers.Length - k && workers[workerIndex] + strength >= tasks[i]) |
| | 20 | 73 | | { |
| | 20 | 74 | | linkedList.AddLast(workers[workerIndex]); |
| | | 75 | | |
| | 20 | 76 | | workerIndex--; |
| | 20 | 77 | | } |
| | | 78 | | |
| | 20 | 79 | | if (linkedList.Count == 0) |
| | 1 | 80 | | { |
| | 1 | 81 | | return false; |
| | | 82 | | } |
| | | 83 | | |
| | 19 | 84 | | if (linkedList.First != null && linkedList.First.Value >= tasks[i]) |
| | 11 | 85 | | { |
| | 11 | 86 | | linkedList.RemoveFirst(); |
| | 11 | 87 | | } |
| | | 88 | | else |
| | 8 | 89 | | { |
| | 8 | 90 | | if (usedPills >= pills) |
| | 2 | 91 | | { |
| | 2 | 92 | | return false; |
| | | 93 | | } |
| | | 94 | | |
| | 6 | 95 | | usedPills++; |
| | | 96 | | |
| | 6 | 97 | | linkedList.RemoveLast(); |
| | 6 | 98 | | } |
| | 17 | 99 | | } |
| | | 100 | | |
| | 8 | 101 | | return true; |
| | 11 | 102 | | } |
| | | 103 | | } |