Updated tags

javadev · javadev · commit be0f557a5878 · 2025-07-22T10:39:56.000+03:00
diff --git a/src/main/java/g3601_3700/s3618_split_array_by_prime_indices/Solution.java b/src/main/java/g3601_3700/s3618_split_array_by_prime_indices/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3618_split_array_by_prime_indices;
 
-// #Medium #2025_07_20_Time_3_ms_(100.00%)_Space_62.52_MB_(100.00%)
+// #Medium #Biweekly_Contest_161 #2025_07_22_Time_3_ms_(100.00%)_Space_62.42_MB_(16.27%)
 
 public class Solution {
     public long splitArray(int[] nums) {
diff --git a/src/main/java/g3601_3700/s3619_count_islands_with_total_value_divisible_by_k/Solution.java b/src/main/java/g3601_3700/s3619_count_islands_with_total_value_divisible_by_k/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3619_count_islands_with_total_value_divisible_by_k;
 
-// #Medium #2025_07_20_Time_16_ms_(96.67%)_Space_70.90_MB_(100.00%)
+// #Medium #Biweekly_Contest_161 #2025_07_22_Time_16_ms_(96.65%)_Space_71.27_MB_(46.65%)
 
 public class Solution {
     private int m;
diff --git a/src/main/java/g3601_3700/s3620_network_recovery_pathways/Solution.java b/src/main/java/g3601_3700/s3620_network_recovery_pathways/Solution.java
@@ -1,59 +1,102 @@
 package g3601_3700.s3620_network_recovery_pathways;
 
-// #Hard #2025_07_20_Time_18_ms_(100.00%)_Space_120.24_MB_(100.00%)
+// #Hard #Biweekly_Contest_161 #2025_07_22_Time_158_ms_(64.00%)_Space_130.14_MB_(14.77%)
 
 import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Queue;
 
-@SuppressWarnings("unchecked")
 public class Solution {
-    private int ans = -1;
-    private int d;
-    private long k = 0;
-
-    public int findMaxPathScore(int[][] edges, boolean[] online, long k) {
-        int n = online.length;
-        this.k = k;
-        this.d = n - 1;
-        ArrayList<P>[] g = new ArrayList[n];
+    private List<Integer> topologicalSort(int n, List<List<Integer>> g) {
+        int[] indeg = new int[n];
         for (int i = 0; i < n; ++i) {
-            g[i] = new ArrayList<>();
-        }
-        for (int[] i : edges) {
-            if (online[i[0]] && online[i[1]]) {
-                g[i[0]].add(new P(i[1], i[2]));
+            for (int adj_node : g.get(i)) {
+                indeg[adj_node]++;
             }
         }
-        dfs(g, 0, 0L, Integer.MAX_VALUE);
-        return ans;
-    }
-
-    private void dfs(ArrayList<P>[] g, int s, long tc, int max) {
-        if (s == d) {
-            if (ans == -1) {
-                ans = max;
-            } else {
-                ans = Math.max(ans, max);
+        Queue<Integer> q = new LinkedList<>();
+        List<Integer> ts = new ArrayList<>();
+        for (int i = 0; i < n; ++i) {
+            if (indeg[i] == 0) {
+                q.offer(i);
             }
-            return;
         }
-        for (P i : g[s]) {
-            long cost = tc + i.c;
-            if (ans != -1 && ans >= max) {
-                return;
+        while (!q.isEmpty()) {
+            int u = q.poll();
+            ts.add(u);
+            for (int v : g.get(u)) {
+                indeg[v]--;
+                if (indeg[v] == 0) {
+                    q.offer(v);
+                }
             }
-            if (cost <= k) {
-                dfs(g, i.d, cost, Math.min(max, i.c));
+        }
+        return ts;
+    }
+
+    private boolean check(int x, int n, List<List<int[]>> adj, List<Integer> ts, boolean[] online, long k) {
+        long[] d = new long[n];
+        Arrays.fill(d, Long.MAX_VALUE); // Represents INF
+        d[0] = 0;
+        for (int u : ts) {
+            if (d[u] != Long.MAX_VALUE) { // If d[u] is reachable
+                for (int[] p : adj.get(u)) {
+                    int v = p[0];
+                    int c = p[1];
+                    if (c < x || !online[v]) {
+                        continue;
+                    }
+                    if (d[u] + c < d[v]) {
+                        d[v] = d[u] + c;
+                    }
+                }
             }
         }
+        return d[n - 1] <= k;
     }
 
-    private static final class P {
-        int d;
-        int c;
+    public int findMaxPathScore(int[][] edges, boolean[] online, long k) {
+        int n = online.length;
+        // Adjacency list for graph with edge weights
+        List<List<int[]>> adj = new ArrayList<>();
+        for (int i = 0; i < n; i++) {
+            adj.add(new ArrayList<>());
+        }
+        // Adjacency list for topological sort (unweighted graph)
+        List<List<Integer>> g = new ArrayList<>();
+        for (int i = 0; i < n; i++) {
+            g.add(new ArrayList<>());
+        }
+        for (int[] e : edges) {
+            int u = e[0];
+            int v = e[1];
+            int c = e[2];
+            adj.get(u).add(new int[]{v, c});
+            g.get(u).add(v);
+        }
+
+        List<Integer> ts = topologicalSort(n, g);
 
-        P(int d, int c) {
-            this.d = d;
-            this.c = c;
+        // Call the helper method
+        if (!check(0, n, adj, ts, online, k)) {
+            return -1;
+        }
+
+        int l = 0;
+        int h = 0;
+        for (int[] e : edges) {
+            h = Math.max(h, e[2]);
+        }
+        while (l < h) {
+            int md = l + (h - l + 1) / 2;
+            if (check(md, n, adj, ts, online, k)) {
+                l = md;
+            } else {
+                h = md - 1;
+            }
         }
+        return l;
     }
 }
diff --git a/src/main/java/g3601_3700/s3621_number_of_integers_with_popcount_depth_equal_to_k_i/Solution.java b/src/main/java/g3601_3700/s3621_number_of_integers_with_popcount_depth_equal_to_k_i/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3621_number_of_integers_with_popcount_depth_equal_to_k_i;
 
-// #Hard #2025_07_20_Time_1_ms_(100.00%)_Space_41.10_MB_(100.00%)
+// #Hard #Biweekly_Contest_161 #2025_07_22_Time_9_ms_(70.67%)_Space_44.98_MB_(38.42%)
 
 public class Solution {
     private static final int MX_LN = 61;
diff --git a/src/main/java/g3601_3700/s3622_check_divisibility_by_digit_sum_and_product/Solution.java b/src/main/java/g3601_3700/s3622_check_divisibility_by_digit_sum_and_product/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3622_check_divisibility_by_digit_sum_and_product;
 
-// #Easy #2025_07_20_Time_0_ms_(100.00%)_Space_40.53_MB_(_%)
+// #Easy #Weekly_Contest_459 #2025_07_22_Time_0_ms_(100.00%)_Space_41.36_MB_(8.47%)
 
 public class Solution {
     public boolean checkDivisibility(int n) {
diff --git a/src/main/java/g3601_3700/s3623_count_number_of_trapezoids_i/Solution.java b/src/main/java/g3601_3700/s3623_count_number_of_trapezoids_i/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3623_count_number_of_trapezoids_i;
 
-// #Medium #2025_07_20_Time_30_ms_(99.91%)_Space_100.40_MB_(100.00%)
+// #Medium #Weekly_Contest_459 #2025_07_22_Time_27_ms_(100.00%)_Space_101.17_MB_(64.13%)
 
 import java.util.HashMap;
 import java.util.Map;
diff --git a/src/main/java/g3601_3700/s3624_number_of_integers_with_popcount_depth_equal_to_k_ii/Solution.java b/src/main/java/g3601_3700/s3624_number_of_integers_with_popcount_depth_equal_to_k_ii/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3624_number_of_integers_with_popcount_depth_equal_to_k_ii;
 
-// #Hard #2025_07_20_Time_27_ms_(96.92%)_Space_125.98_MB_(100.00%)
+// #Hard #Weekly_Contest_459 #2025_07_22_Time_26_ms_(97.90%)_Space_99.87_MB_(97.09%)
 
 import java.util.ArrayList;
 
diff --git a/src/main/java/g3601_3700/s3625_count_number_of_trapezoids_ii/Solution.java b/src/main/java/g3601_3700/s3625_count_number_of_trapezoids_ii/Solution.java
@@ -1,6 +1,6 @@
 package g3601_3700.s3625_count_number_of_trapezoids_ii;
 
-// #Hard #2025_07_21_Time_354_ms_(100.00%)_Space_131.52_MB_(52.31%)
+// #Hard #Weekly_Contest_459 #2025_07_22_Time_372_ms_(97.30%)_Space_154.52_MB_(31.53%)
 
 import java.util.HashMap;
 import java.util.Map;
