fixes

Author: lrvideckis

library/data_structures/dsu/range_parallel_equivalence_classes.hpp

@@ -7,11 +7,11 @@
 UF get_rp_dsu(const vector<array<int, 3>>& rests, int n) {
   vector<vector<pii>> rests_by_len(n + 1);
   for (auto [l1, l2, len] : rests)
-    rests_by_len[len].push_back({l1, l2});
+    rests_by_len[len].emplace_back(l1, l2);
   UF uf(n);
   for (int len = n; len > 0; len--)
     for (auto [l1, l2] : rests_by_len[len])
       if (uf.join(l1, l2))
-        rests_by_len[len - 1].push_back({l1 + 1, l2 + 1});
+        rests_by_len[len - 1].emplace_back(l1 + 1, l2 + 1);
   return uf;
 }

library/math/matrix_related/xor_basis_unordered_intersection.hpp

@@ -6,14 +6,14 @@
 template<class T>
 basis<T> intersection(const basis<T>& u,
   const basis<T>& v) {
-  vector<array<T, 2>> w;
-  for (T e : u.b) w.push_back({e, e});
+  vector<pair<T, T>> w(sz(u.b));
+  rep(i, 0, sz(w)) w[i] = {u.b[i], u.b[i]};
   basis<T> res;
   for (T e : v.b) {
     T s = 0;
     for (auto [x, y] : w)
       if ((e ^ x) < e) e ^= x, s ^= y;
-    if (e) w.push_back({e, s});
+    if (e) w.emplace_back(e, s);
     else res.insert(s);
   }
   return res;

tests/scripts/build_pdf.sh

@@ -35,7 +35,6 @@ rm ../library/trees/edge_centroid_decomp_uncommon/contour_range_update.hpp || ex
 rm ../library/trees/edge_centroid_decomp_uncommon/count_paths_per_length.hpp || exit 1
 rm ../library/trees/edge_centroid_decomp_uncommon/sum_adjacent.hpp || exit 1
 rm ../library/trees/ladder_decomposition/ladder_decomposition.hpp || exit 1
-rm ../library/trees/linear_kth_path.hpp || exit 1
 
 # remove links in comments: these aren't useful in the PDF, and are usually the
 # longest words which extend into the next column