Added tags

javadev · javadev · commit 7af416cb3183 · 2025-09-26T09:01:54.000+03:00
diff --git a/src/main/java/g3601_3700/s3669_balanced_k_factor_decomposition/Solution.java b/src/main/java/g3601_3700/s3669_balanced_k_factor_decomposition/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3669_balanced_k_factor_decomposition;
 
-// #Medium #Weekly_Contest_465 #2025_09_06_Time_13_ms_(78.36%)_Space_45.64_MB_(10.38%)
+// #Medium #Math #Backtracking #Number_Theory #Weekly_Contest_465
+// #2025_09_26_Time_14_ms_(77.10%)_Space_45.18_MB_(43.88%)
 
 import java.util.ArrayList;
 import java.util.Collections;
diff --git a/src/main/java/g3601_3700/s3670_maximum_product_of_two_integers_with_no_common_bits/Solution.java b/src/main/java/g3601_3700/s3670_maximum_product_of_two_integers_with_no_common_bits/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3670_maximum_product_of_two_integers_with_no_common_bits;
 
-// #Medium #Weekly_Contest_465 #2025_09_06_Time_151_ms_(99.28%)_Space_64.23_MB_(47.58%)
+// #Medium #Array #Dynamic_Programming #Bit_Manipulation #Weekly_Contest_465
+// #2025_09_26_Time_159_ms_(98.86%)_Space_64.54_MB_(25.90%)
 
 public class Solution {
     public long maxProduct(int[] nums) {
diff --git a/src/main/java/g3601_3700/s3671_sum_of_beautiful_subsequences/Solution.java b/src/main/java/g3601_3700/s3671_sum_of_beautiful_subsequences/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3671_sum_of_beautiful_subsequences;
 
-// #Hard #Weekly_Contest_465 #2025_09_06_Time_233_ms_(96.31%)_Space_62.03_MB_(69.80%)
+// #Hard #Array #Math #Tree #Number_Theory #Weekly_Contest_465
+// #2025_09_26_Time_232_ms_(92.27%)_Space_56.32_MB_(82.85%)
 
 public class Solution {
     private static final int MOD = 1000000007;
diff --git a/src/main/java/g3601_3700/s3674_minimum_operations_to_equalize_array/Solution.java b/src/main/java/g3601_3700/s3674_minimum_operations_to_equalize_array/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3674_minimum_operations_to_equalize_array;
 
-// #Easy #Weekly_Contest_466 #2025_09_07_Time_1_ms_(100.00%)_Space_43.98_MB_(100.00%)
+// #Easy #Array #Bit_Manipulation #Brainteaser #Weekly_Contest_466
+// #2025_09_26_Time_0_ms_(100.00%)_Space_43.29_MB_(90.84%)
 
 public class Solution {
     public int minOperations(int[] nums) {
diff --git a/src/main/java/g3601_3700/s3675_minimum_operations_to_transform_string/Solution.java b/src/main/java/g3601_3700/s3675_minimum_operations_to_transform_string/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3675_minimum_operations_to_transform_string;
 
-// #Medium #Weekly_Contest_466 #2025_09_14_Time_5_ms_(100.00%)_Space_47.93_MB_(95.06%)
+// #Medium #String #Greedy #Weekly_Contest_466
+// #2025_09_26_Time_5_ms_(100.00%)_Space_47.76_MB_(98.96%)
 
 public class Solution {
     public int minOperations(String s) {
diff --git a/src/main/java/g3601_3700/s3676_count_bowl_subarrays/Solution.java b/src/main/java/g3601_3700/s3676_count_bowl_subarrays/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3676_count_bowl_subarrays;
 
-// #Medium #Weekly_Contest_466 #2025_09_14_Time_2_ms_(100.00%)_Space_58.91_MB_(69.85%)
+// #Medium #Array #Stack #Monotonic_Stack #Weekly_Contest_466
+// #2025_09_26_Time_2_ms_(100.00%)_Space_58.70_MB_(69.49%)
 
 public class Solution {
     public long bowlSubarrays(int[] nums) {
diff --git a/src/main/java/g3601_3700/s3677_count_binary_palindromic_numbers/Solution.java b/src/main/java/g3601_3700/s3677_count_binary_palindromic_numbers/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3677_count_binary_palindromic_numbers;
 
-// #Hard #Weekly_Contest_466 #2025_09_07_Time_1_ms_(100.00%)_Space_40.86_MB_(100.00%)
+// #Hard #Math #Bit_Manipulation #Weekly_Contest_466
+// #2025_09_26_Time_1_ms_(100.00%)_Space_40.82_MB_(77.82%)
 
 public class Solution {
     private long makePalin(long left, boolean odd) {
diff --git a/src/main/java/g3601_3700/s3678_smallest_absent_positive_greater_than_average/Solution.java b/src/main/java/g3601_3700/s3678_smallest_absent_positive_greater_than_average/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3678_smallest_absent_positive_greater_than_average;
 
-// #Easy #Biweekly_Contest_165 #2025_09_20_Time_2_ms_(100.00%)_Space_45.28_MB_(53.71%)
+// #Easy #Array #Hash_Table #Biweekly_Contest_165
+// #2025_09_26_Time_2_ms_(100.00%)_Space_45.02_MB_(77.05%)
 
 public class Solution {
     public int smallestAbsent(int[] nums) {
diff --git a/src/main/java/g3601_3700/s3679_minimum_discards_to_balance_inventory/Solution.java b/src/main/java/g3601_3700/s3679_minimum_discards_to_balance_inventory/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3679_minimum_discards_to_balance_inventory;
 
-// #Medium #Biweekly_Contest_165 #2025_09_20_Time_2_ms_(100.00%)_Space_60.72_MB_(75.43%)
+// #Medium #Array #Hash_Table #Simulation #Counting #Sliding_Window #Biweekly_Contest_165
+// #2025_09_26_Time_2_ms_(100.00%)_Space_61.06_MB_(68.83%)
 
 public class Solution {
     public int minArrivalsToDiscard(int[] arrivals, int w, int m) {
diff --git a/src/main/java/g3601_3700/s3680_generate_schedule/Solution.java b/src/main/java/g3601_3700/s3680_generate_schedule/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3680_generate_schedule;
 
-// #Medium #Biweekly_Contest_165 #2025_09_20_Time_2_ms_(100.00%)_Space_45.33_MB_(59.29%)
+// #Medium #Array #Math #Greedy #Biweekly_Contest_165
+// #2025_09_26_Time_2_ms_(100.00%)_Space_45.58_MB_(29.48%)
 
 public class Solution {
     public int[][] generateSchedule(int n) {
diff --git a/src/main/java/g3601_3700/s3681_maximum_xor_of_subsequences/Solution.java b/src/main/java/g3601_3700/s3681_maximum_xor_of_subsequences/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3681_maximum_xor_of_subsequences;
 
-// #Hard #Biweekly_Contest_165 #2025_09_20_Time_27_ms_(99.73%)_Space_58.35_MB_(30.31%)
+// #Hard #Array #Math #Greedy #Bit_Manipulation #Biweekly_Contest_165
+// #2025_09_26_Time_28_ms_(98.28%)_Space_57.46_MB_(98.97%)
 
 public class Solution {
     public int maxXorSubsequences(int[] nums) {
diff --git a/src/main/java/g3601_3700/s3683_earliest_time_to_finish_one_task/Solution.java b/src/main/java/g3601_3700/s3683_earliest_time_to_finish_one_task/Solution.java
@@ -1,13 +1,13 @@
 package g3601_3700.s3683_earliest_time_to_finish_one_task;
 
-// #Easy #Weekly_Contest_467 #2025_09_20_Time_0_ms_(100.00%)_Space_45.29_MB_(39.62%)
+// #Easy #Array #Weekly_Contest_467 #2025_09_26_Time_1_ms_(77.01%)_Space_45.24_MB_(38.70%)
 
 public class Solution {
     public int earliestTime(int[][] tasks) {
         int ans = 1000;
-        for (int i = 0; i < tasks.length; i++) {
-            int st = tasks[i][0];
-            int tm = tasks[i][1];
+        for (int[] task : tasks) {
+            int st = task[0];
+            int tm = task[1];
             ans = Math.min(ans, st + tm);
         }
         return ans;
diff --git a/src/main/java/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements/Solution.java b/src/main/java/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3684_maximize_sum_of_at_most_k_distinct_elements;
 
-// #Easy #Weekly_Contest_467 #2025_09_20_Time_2_ms_(100.00%)_Space_45.58_MB_(68.55%)
+// #Easy #Array #Hash_Table #Sorting #Greedy #Weekly_Contest_467
+// #2025_09_26_Time_3_ms_(99.92%)_Space_45.48_MB_(84.34%)
 
 import java.util.Arrays;
 
diff --git a/src/main/java/g3601_3700/s3685_subsequence_sum_after_capping_elements/Solution.java b/src/main/java/g3601_3700/s3685_subsequence_sum_after_capping_elements/Solution.java
@@ -1,22 +1,21 @@
 package g3601_3700.s3685_subsequence_sum_after_capping_elements;
 
-// #Medium #Weekly_Contest_467 #2025_09_20_Time_24_ms_(96.07%)_Space_45.39_MB_(97.38%)
+// #Medium #Array #Dynamic_Programming #Sorting #Two_Pointers #Weekly_Contest_467
+// #2025_09_26_Time_24_ms_(96.44%)_Space_45.98_MB_(36.73%)
 
 public class Solution {
     public boolean[] subsequenceSumAfterCapping(int[] nums, int k) {
-        int[] zolvarinte = nums;
-        int n = zolvarinte.length;
+        int n = nums.length;
         boolean[] answer = new boolean[n];
-        int maxV = n;
-        int[] freq = new int[maxV + 2];
-        for (int v : zolvarinte) {
-            if (v <= maxV) {
+        int[] freq = new int[n + 2];
+        for (int v : nums) {
+            if (v <= n) {
                 freq[v]++;
             }
         }
-        int[] cntGe = new int[maxV + 2];
-        cntGe[maxV] = freq[maxV];
-        for (int x = maxV - 1; x >= 1; x--) {
+        int[] cntGe = new int[n + 2];
+        cntGe[n] = freq[n];
+        for (int x = n - 1; x >= 1; x--) {
             cntGe[x] = cntGe[x + 1] + freq[x];
         }
         boolean[] dp = new boolean[k + 1];
diff --git a/src/main/java/g3601_3700/s3686_number_of_stable_subsequences/Solution.java b/src/main/java/g3601_3700/s3686_number_of_stable_subsequences/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3686_number_of_stable_subsequences;
 
-// #Hard #Weekly_Contest_467 #2025_09_20_Time_9_ms_(99.94%)_Space_59.73_MB_(89.70%)
+// #Hard #Array #Dynamic_Programming #Weekly_Contest_467
+// #2025_09_26_Time_9_ms_(99.95%)_Space_60.26_MB_(57.85%)
 
 public class Solution {
     private static final long MOD = 1000000007L;
diff --git a/src/main/java/g3601_3700/s3688_bitwise_or_of_even_numbers_in_an_array/Solution.java b/src/main/java/g3601_3700/s3688_bitwise_or_of_even_numbers_in_an_array/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3688_bitwise_or_of_even_numbers_in_an_array;
 
-// #Easy #Weekly_Contest_468 #2025_09_21_Time_0_ms_(100.00%)_Space_43.23_MB_(100.00%)
+// #Easy #Array #Bit_Manipulation #Simulation #Weekly_Contest_468
+// #2025_09_26_Time_0_ms_(100.00%)_Space_42.64_MB_(87.38%)
 
 public class Solution {
     public int evenNumberBitwiseORs(int[] nums) {
diff --git a/src/main/java/g3601_3700/s3689_maximum_total_subarray_value_i/Solution.java b/src/main/java/g3601_3700/s3689_maximum_total_subarray_value_i/Solution.java
@@ -1,6 +1,7 @@
 package g3601_3700.s3689_maximum_total_subarray_value_i;
 
-// #Medium #Weekly_Contest_468 #2025_09_21_Time_1_ms_(100.00%)_Space_55.63_MB_(100.00%)
+// #Medium #Array #Greedy #Weekly_Contest_468
+// #2025_09_26_Time_1_ms_(100.00%)_Space_55.58_MB_(71.81%)
 
 public class Solution {
     public long maxTotalValue(int[] num, int k) {
diff --git a/src/main/java/g3601_3700/s3691_maximum_total_subarray_value_ii/Solution.java b/src/main/java/g3601_3700/s3691_maximum_total_subarray_value_ii/Solution.java
@@ -1,64 +1,64 @@
 package g3601_3700.s3691_maximum_total_subarray_value_ii;
 
-// #Hard #Weekly_Contest_468 #2025_09_21_Time_200_ms_(100.00%)_Space_68.71_MB_(100.00%)
+// #Hard #Array #Greedy #Heap_Priority_Queue #Segment_Tree #Weekly_Contest_468
+// #2025_09_26_Time_89_ms_(80.08%)_Space_81.62_MB_(23.69%)
 
 import java.util.PriorityQueue;
-import java.util.function.IntBinaryOperator;
 
 public class Solution {
-    private static class SparseTableOp {
-        private final int[][] table;
-        private final IntBinaryOperator op;
+    private static class Sparse {
+        long[][] mn;
+        long[][] mx;
+        int[] log;
 
-        public SparseTableOp(int[] arr, IntBinaryOperator op) {
-            this.op = op;
-            int n = arr.length;
-            int maxLog = 31 - Integer.numberOfLeadingZeros(n);
-            this.table = new int[n][maxLog + 1];
+        Sparse(int[] a) {
+            int n = a.length;
+            int zerosN = 32 - Integer.numberOfLeadingZeros(n);
+            mn = new long[zerosN][n];
+            mx = new long[zerosN][n];
+            log = new int[n + 1];
+            for (int i = 2; i <= n; i++) {
+                log[i] = log[i / 2] + 1;
+            }
             for (int i = 0; i < n; i++) {
-                table[i][0] = arr[i];
+                mn[0][i] = mx[0][i] = a[i];
             }
-            for (int j = 1; j <= maxLog; j++) {
-                for (int i = 0; i + (1 << j) <= n; i++) {
-                    table[i][j] = op.applyAsInt(table[i][j - 1], table[i + (1 << (j - 1))][j - 1]);
+            for (int k = 1; k < zerosN; k++) {
+                for (int i = 0; i + (1 << k) <= n; i++) {
+                    mn[k][i] = Math.min(mn[k - 1][i], mn[k - 1][i + (1 << (k - 1))]);
+                    mx[k][i] = Math.max(mx[k - 1][i], mx[k - 1][i + (1 << (k - 1))]);
                 }
             }
         }
 
-        public int query(int left, int right) {
-            int length = right - left + 1;
-            int k = 31 - Integer.numberOfLeadingZeros(length);
-            return op.applyAsInt(table[left][k], table[right - (1 << k) + 1][k]);
+        long getMin(int l, int r) {
+            int k = log[r - l + 1];
+            return Math.min(mn[k][l], mn[k][r - (1 << k) + 1]);
+        }
+
+        long getMax(int l, int r) {
+            int k = log[r - l + 1];
+            return Math.max(mx[k][l], mx[k][r - (1 << k) + 1]);
         }
     }
 
     public long maxTotalValue(int[] nums, int k) {
         int n = nums.length;
-        if (n == 0 || k == 0) {
-            return 0;
-        }
-        SparseTableOp smin = new SparseTableOp(nums, Math::min);
-        SparseTableOp smax = new SparseTableOp(nums, Math::max);
+        Sparse st = new Sparse(nums);
         PriorityQueue<long[]> pq = new PriorityQueue<>((a, b) -> Long.compare(b[0], a[0]));
         for (int i = 0; i < n; i++) {
-            long value = (long) smax.query(i, n - 1) - smin.query(i, n - 1);
-            pq.offer(new long[] {value, i, n - 1});
+            pq.add(new long[] {st.getMax(i, n - 1) - st.getMin(i, n - 1), i, n - 1});
         }
-        long totalValue = 0;
-        for (int i = 0; i < k; i++) {
-            if (pq.isEmpty()) {
-                break;
-            }
-            long[] top = pq.poll();
-            long value = top[0];
-            int start = (int) top[1];
-            int end = (int) top[2];
-            totalValue += value;
-            if (end > start) {
-                long nextValue = (long) smax.query(start, end - 1) - smin.query(start, end - 1);
-                pq.offer(new long[] {nextValue, start, end - 1});
+        long ans = 0;
+        while (k-- > 0 && !pq.isEmpty()) {
+            var cur = pq.poll();
+            ans += cur[0];
+            int l = (int) cur[1];
+            int r = (int) cur[2];
+            if (r - 1 > l) {
+                pq.add(new long[] {st.getMax(l, r - 1) - st.getMin(l, r - 1), l, r - 1});
             }
         }
-        return totalValue;
+        return ans;
     }
 }
