[LeetCode Sync] Runtime - 443 ms (90.57%), Memory - 105.8 MB (32.83%)

Author: NamVr

3678-design-task-manager/README.md

@@ -0,0 +1,56 @@
+<p>There is a task management system that allows users to manage their tasks, each associated with a priority. The system should efficiently handle adding, modifying, executing, and removing tasks.</p>
+
+<p>Implement the <code>TaskManager</code> class:</p>
+
+<ul>
+	<li>
+	<p><code>TaskManager(vector&lt;vector&lt;int&gt;&gt;&amp; tasks)</code> initializes the task manager with a list of user-task-priority triples. Each element in the input list is of the form <code>[userId, taskId, priority]</code>, which adds a task to the specified user with the given priority.</p>
+	</li>
+	<li>
+	<p><code>void add(int userId, int taskId, int priority)</code> adds a task with the specified <code>taskId</code> and <code>priority</code> to the user with <code>userId</code>. It is <strong>guaranteed</strong> that <code>taskId</code> does not <em>exist</em> in the system.</p>
+	</li>
+	<li>
+	<p><code>void edit(int taskId, int newPriority)</code> updates the priority of the existing <code>taskId</code> to <code>newPriority</code>. It is <strong>guaranteed</strong> that <code>taskId</code> <em>exists</em> in the system.</p>
+	</li>
+	<li>
+	<p><code>void rmv(int taskId)</code> removes the task identified by <code>taskId</code> from the system. It is <strong>guaranteed</strong> that <code>taskId</code> <em>exists</em> in the system.</p>
+	</li>
+	<li>
+	<p><code>int execTop()</code> executes the task with the <strong>highest</strong> priority across all users. If there are multiple tasks with the same <strong>highest</strong> priority, execute the one with the highest <code>taskId</code>. After executing, the<strong> </strong><code>taskId</code><strong> </strong>is <strong>removed</strong> from the system. Return the <code>userId</code> associated with the executed task. If no tasks are available, return -1.</p>
+	</li>
+</ul>
+
+<p><strong>Note</strong> that a user may be assigned multiple tasks.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<div class="example-block">
+<p><strong>Input:</strong><br />
+<span class="example-io">[&quot;TaskManager&quot;, &quot;add&quot;, &quot;edit&quot;, &quot;execTop&quot;, &quot;rmv&quot;, &quot;add&quot;, &quot;execTop&quot;]<br />
+[[[[1, 101, 10], [2, 102, 20], [3, 103, 15]]], [4, 104, 5], [102, 8], [], [101], [5, 105, 15], []]</span></p>
+
+<p><strong>Output:</strong><br />
+<span class="example-io">[null, null, null, 3, null, null, 5] </span></p>
+
+<p><strong>Explanation</strong></p>
+TaskManager taskManager = new TaskManager([[1, 101, 10], [2, 102, 20], [3, 103, 15]]); // Initializes with three tasks for Users 1, 2, and 3.<br />
+taskManager.add(4, 104, 5); // Adds task 104 with priority 5 for User 4.<br />
+taskManager.edit(102, 8); // Updates priority of task 102 to 8.<br />
+taskManager.execTop(); // return 3. Executes task 103 for User 3.<br />
+taskManager.rmv(101); // Removes task 101 from the system.<br />
+taskManager.add(5, 105, 15); // Adds task 105 with priority 15 for User 5.<br />
+taskManager.execTop(); // return 5. Executes task 105 for User 5.</div>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= tasks.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= userId &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= taskId &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= priority &lt;= 10<sup>9</sup></code></li>
+	<li><code>0 &lt;= newPriority &lt;= 10<sup>9</sup></code></li>
+	<li>At most <code>2 * 10<sup>5</sup></code> calls will be made in <strong>total</strong> to <code>add</code>, <code>edit</code>, <code>rmv</code>, and <code>execTop</code> methods.</li>
+	<li>The input is generated such that <code>taskId</code> will be valid.</li>
+</ul>

3678-design-task-manager/solution.py

@@ -0,0 +1,36 @@
+class TaskManager(object):
+    def __init__(self, tasks):
+        self.heap = []
+        self.taskPriority = {}
+        self.taskOwner = {}
+        for t in tasks:
+            self.add(t[0], t[1], t[2])
+
+    def add(self, userId, taskId, priority):
+        heapq.heappush(self.heap, (-priority, -taskId))
+        self.taskPriority[taskId] = priority
+        self.taskOwner[taskId] = userId
+
+    def edit(self, taskId, newPriority):
+        heapq.heappush(self.heap, (-newPriority, -taskId))
+        self.taskPriority[taskId] = newPriority
+
+    def rmv(self, taskId):
+        self.taskPriority[taskId] = -1
+
+    def execTop(self):
+        while self.heap:
+            negp, negid = heapq.heappop(self.heap)
+            p = -negp
+            tid = -negid
+            if self.taskPriority.get(tid, -2) == p:
+                self.taskPriority[tid] = -1
+                return self.taskOwner.get(tid, -1)
+        return -1
+
+# Your TaskManager object will be instantiated and called as such:
+# obj = TaskManager(tasks)
+# obj.add(userId,taskId,priority)
+# obj.edit(taskId,newPriority)
+# obj.rmv(taskId)
+# param_4 = obj.execTop()