fix solutions

Author: therepanic

tests/501-1000/834. sum-of-distances-in-tree/manifest.yaml

@@ -30,11 +30,35 @@ limits:
   memory_mb: 512
 oracle:
   python3:
-    call: "Checker().check({result})"
+    call: "Checker().check(n, edges, {result})"
     checker: |
+      from collections import deque
+
       class Checker:
-          def check(self, result):
-              return isinstance(result, list) and all(isinstance(value, int) for value in result)
+          def check(self, n, edges, result):
+              if not isinstance(result, list) or len(result) != n:
+                  return False
+              if any(type(value) is not int for value in result):
+                  return False
+
+              graph = [[] for _ in range(n)]
+              for left, right in edges:
+                  graph[left].append(right)
+                  graph[right].append(left)
+
+              expected = []
+              for start in range(n):
+                  distance = [-1] * n
+                  distance[start] = 0
+                  queue = deque([start])
+                  while queue:
+                      node = queue.popleft()
+                      for neighbor in graph[node]:
+                          if distance[neighbor] == -1:
+                              distance[neighbor] = distance[node] + 1
+                              queue.append(neighbor)
+                  expected.append(sum(distance))
+              return result == expected
 seed: 834
 tests:
   - name: n1

tests/501-1000/834. sum-of-distances-in-tree/sol.java

@@ -1,4 +1,5 @@
 class Solution {
+    @SuppressWarnings("unchecked")
     public int[] sumOfDistancesInTree(int n, int[][] edges) {
         List<Integer>[] adj = new ArrayList[n];
         for (int i = 0; i < n; i++) adj[i] = new ArrayList<>();

tests/501-1000/870. advantage-shuffle/manifest.yaml

@@ -26,7 +26,7 @@ entry:
 judge:
   type: exact
 limits:
-  time_ms: 200
+  time_ms: 1500
   memory_mb: 300
 oracle:
   python3: