| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.DesignTaskManager; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class DesignTaskManagerDictionaryWithPriorityQueue : IDesignTaskManager |
| | | 16 | | { |
| | 1 | 17 | | private readonly PriorityQueue<TaskIdPriority, TaskIdPriority> _taskIdPriorityQueue = new(); |
| | 1 | 18 | | private readonly Dictionary<int, UserIdPriority> _taskIdToUserIdPriorityDictionary = []; |
| | | 19 | | |
| | | 20 | | /// <summary> |
| | | 21 | | /// Time complexity - O(n log n) |
| | | 22 | | /// Space complexity - O(n) |
| | | 23 | | /// </summary> |
| | | 24 | | /// <param name="tasks"></param> |
| | 1 | 25 | | public DesignTaskManagerDictionaryWithPriorityQueue(IList<IList<int>> tasks) |
| | 1 | 26 | | { |
| | 1 | 27 | | var n = tasks.Count; |
| | | 28 | | |
| | 8 | 29 | | for (var i = 0; i < n; i++) |
| | 3 | 30 | | { |
| | 3 | 31 | | var userId = tasks[i][0]; |
| | 3 | 32 | | var taskId = tasks[i][1]; |
| | 3 | 33 | | var priority = tasks[i][2]; |
| | | 34 | | |
| | 3 | 35 | | _taskIdToUserIdPriorityDictionary.Add(taskId, new UserIdPriority(userId, priority)); |
| | | 36 | | |
| | 3 | 37 | | var taskIdPriority = new TaskIdPriority(taskId, priority); |
| | | 38 | | |
| | 3 | 39 | | _taskIdPriorityQueue.Enqueue(taskIdPriority, taskIdPriority); |
| | 3 | 40 | | } |
| | 1 | 41 | | } |
| | | 42 | | |
| | | 43 | | /// <summary> |
| | | 44 | | /// Time complexity - O(log n) |
| | | 45 | | /// Space complexity - O(1) |
| | | 46 | | /// </summary> |
| | | 47 | | /// <param name="userId"></param> |
| | | 48 | | /// <param name="taskId"></param> |
| | | 49 | | /// <param name="priority"></param> |
| | | 50 | | public void Add(int userId, int taskId, int priority) |
| | 2 | 51 | | { |
| | 2 | 52 | | _taskIdToUserIdPriorityDictionary[taskId] = new UserIdPriority(userId, priority); |
| | | 53 | | |
| | 2 | 54 | | var taskIdPriority = new TaskIdPriority(taskId, priority); |
| | | 55 | | |
| | 2 | 56 | | _taskIdPriorityQueue.Enqueue(taskIdPriority, taskIdPriority); |
| | 2 | 57 | | } |
| | | 58 | | |
| | | 59 | | /// <summary> |
| | | 60 | | /// Time complexity - O(log n) |
| | | 61 | | /// Space complexity - O(1) |
| | | 62 | | /// </summary> |
| | | 63 | | /// <param name="taskId"></param> |
| | | 64 | | /// <param name="newPriority"></param> |
| | | 65 | | public void Edit(int taskId, int newPriority) |
| | 1 | 66 | | { |
| | 1 | 67 | | var userIdPriority = _taskIdToUserIdPriorityDictionary[taskId]; |
| | 1 | 68 | | var editedUserIdPriority = userIdPriority with { Priority = newPriority }; |
| | | 69 | | |
| | 1 | 70 | | _taskIdToUserIdPriorityDictionary[taskId] = editedUserIdPriority; |
| | | 71 | | |
| | 1 | 72 | | var taskIdPriority = new TaskIdPriority(taskId, newPriority); |
| | | 73 | | |
| | 1 | 74 | | _taskIdPriorityQueue.Enqueue(taskIdPriority, taskIdPriority); |
| | 1 | 75 | | } |
| | | 76 | | |
| | | 77 | | /// <summary> |
| | | 78 | | /// Time complexity - O(1) |
| | | 79 | | /// Space complexity - O(1) |
| | | 80 | | /// </summary> |
| | | 81 | | /// <param name="taskId"></param> |
| | | 82 | | public void Rmv(int taskId) |
| | 3 | 83 | | { |
| | 3 | 84 | | _taskIdToUserIdPriorityDictionary.Remove(taskId); |
| | 3 | 85 | | } |
| | | 86 | | |
| | | 87 | | /// <summary> |
| | | 88 | | /// Time complexity - O(log n) |
| | | 89 | | /// Space complexity - O(1) |
| | | 90 | | /// </summary> |
| | | 91 | | /// <returns></returns> |
| | | 92 | | public int ExecTop() |
| | 2 | 93 | | { |
| | 3 | 94 | | while (_taskIdPriorityQueue.Count > 0) |
| | 3 | 95 | | { |
| | 3 | 96 | | var taskIdPriority = _taskIdPriorityQueue.Dequeue(); |
| | | 97 | | |
| | 3 | 98 | | if (!_taskIdToUserIdPriorityDictionary.TryGetValue(taskIdPriority.TaskId, out var userIdPriority) || |
| | 3 | 99 | | userIdPriority.Priority != taskIdPriority.Priority) |
| | 1 | 100 | | { |
| | 1 | 101 | | continue; |
| | | 102 | | } |
| | | 103 | | |
| | 2 | 104 | | Rmv(taskIdPriority.TaskId); |
| | | 105 | | |
| | 2 | 106 | | return userIdPriority.UserId; |
| | | 107 | | } |
| | | 108 | | |
| | 0 | 109 | | return -1; |
| | 2 | 110 | | } |
| | | 111 | | |
| | 6 | 112 | | private readonly record struct UserIdPriority(int UserId, int Priority); |
| | | 113 | | |
| | | 114 | | private readonly struct TaskIdPriority : IComparable<TaskIdPriority> |
| | | 115 | | { |
| | 5 | 116 | | public int TaskId { get; } |
| | | 117 | | |
| | 27 | 118 | | public int Priority { get; } |
| | | 119 | | |
| | | 120 | | public TaskIdPriority(int taskId, int priority) |
| | 6 | 121 | | { |
| | 6 | 122 | | TaskId = taskId; |
| | 6 | 123 | | Priority = priority; |
| | 6 | 124 | | } |
| | | 125 | | |
| | | 126 | | public int CompareTo(TaskIdPriority taskPriority) |
| | 12 | 127 | | { |
| | 12 | 128 | | var priorityCompare = CompareToPriority(taskPriority.Priority); |
| | | 129 | | |
| | 12 | 130 | | if (priorityCompare == 0) |
| | 0 | 131 | | { |
| | 0 | 132 | | return CompareToTaskId(taskPriority.TaskId); |
| | | 133 | | } |
| | | 134 | | |
| | 12 | 135 | | return priorityCompare; |
| | 12 | 136 | | } |
| | | 137 | | |
| | | 138 | | private int CompareToPriority(int priority) |
| | 12 | 139 | | { |
| | 12 | 140 | | return priority.CompareTo(Priority); |
| | 12 | 141 | | } |
| | | 142 | | |
| | | 143 | | private int CompareToTaskId(int taskId) |
| | 0 | 144 | | { |
| | 0 | 145 | | return taskId.CompareTo(TaskId); |
| | 0 | 146 | | } |
| | | 147 | | } |
| | | 148 | | } |