added 2593, 3264

Author: rustykitty

2593-find-score-of-an-array-after-marking-all-elements.cpp

@@ -0,0 +1,35 @@
+/*
+2593. Find Score of an Array After Marking All Elements
+
+LeetCode Daily Question for December 13, 2024
+
+Runtime: 204 ms (beats 28.68%)
+Memory: 143.70 MB (beats 18.41%)
+*/
+
+class Solution {
+public:
+    long long findScore(vector<int>& nums) {
+        unordered_set<int> marked;
+        vector<pair<int, int>> sorted_nums;
+        sorted_nums.reserve(nums.size());
+        for (int i = 0; i < nums.size(); ++i) {
+            sorted_nums.push_back({ i, nums[i] });
+        }
+        sort(sorted_nums.begin(), sorted_nums.end(), [](pair<int, int> x, pair<int, int> y){
+            return  x.second < y.second ? true :
+                   x.second == y.second ? x.first < y.first :
+                                          false;
+        });
+        long long score = 0;
+        for (const pair<int, int>& p : sorted_nums) {
+            if (marked.count(p.first)) continue;
+            score += p.second;
+            marked.insert(p.first);
+            if (p.first > 0) marked.insert(p.first - 1);
+            if (p.first < nums.size()) marked.insert(p.first + 1);
+
+        }
+        return score;
+    }
+};

2593-find-score-of-an-array-after-marking-all-elements.py

@@ -0,0 +1,21 @@
+"""
+2593. Find Score of an Array After Marking All Elements
+
+LeetCode Daily Question for December 13, 2024
+
+Runtime: 248 ms (beats 84.86%)
+Memory: 43.81 MB (beats 32.48%)
+"""
+
+class Solution:
+    def findScore(self, nums: List[int]) -> int:
+        marked = set()
+        score = 0
+        for i, j in sorted(enumerate(nums), key=lambda x: x[1]):
+            if i in marked:
+                continue
+            score += j
+            marked.add(i)
+            marked.add(i - 1)
+            marked.add(i + 1)
+        return score

3264-final-array-state-after-k-multiplication-operations-i.cpp

@@ -0,0 +1,22 @@
+/*
+3264. Final Array State After K Multiplication Operations I
+
+LeetCode Daily Question for December 15, 2024
+
+Runtime: 0 ms (beats 100.00%)
+Memory: 27.17 MB (beats 46.57%)
+*/
+
+class Solution {
+public:
+    vector<int> getFinalState(vector<int>& nums, int k, int multiplier) {
+        for (int i = 0; i < k; ++i) {
+            auto pos = nums.begin();
+            for (auto it = nums.begin() + 1; it != nums.end(); ++it) {
+                if (*it < *pos) pos = it;
+            }
+            *pos = *pos * multiplier;
+        }
+        return nums;
+    }
+};

3264-final-array-state-after-k-multiplication-operations-i.py

@@ -0,0 +1,16 @@
+"""
+3264. Final Array State After K Multiplication Operations I
+
+LeetCode Daily Question for December 15, 2024
+
+Runtime: 255 ms (beats 5.80%)
+Memory: 17.51 MB (beats 12.46%)
+"""
+
+class Solution:
+    def getFinalState(self, nums: List[int], k: int, multiplier: int) -> List[int]:
+        return reduce(
+            lambda x, _: [x[i] * multiplier if i == (min(enumerate(x), key = (lambda e: e[1]))[0]) else x[i] for i in range(len(x))],
+            range(k),
+            nums
+        )