programming-team-code · lrvideckis · Apr 12, 2026 · Apr 12, 2026 · Apr 12, 2026 · Apr 12, 2026
diff --git a/library/convolution/min_plus_convolution_convex_and_arbitrary.hpp b/library/convolution/min_plus_convolution_convex_and_arbitrary.hpp
@@ -9,8 +9,8 @@ vi min_plus(const vi& convex, const vi& arbitrary) {
   int n = sz(convex);
   int m = sz(arbitrary);
   vi res(n + m - 1, INT_MAX);
-  auto dnc = [&](auto&& dnc, int res_le, int res_ri,
-               int arb_le, int arb_ri) -> void {
+  auto dnc = [&](auto dnc, int res_le, int res_ri,
+               int arb_le, int arb_ri) {
     if (res_le >= res_ri) return;
     int mid_res = (res_le + res_ri) / 2;
     int op_arb = arb_le;

diff --git a/library/graphs/bcc_callback.hpp b/library/graphs/bcc_callback.hpp
@@ -44,7 +44,7 @@
 void bcc(const auto& g, auto f) {
   int n = sz(g), q = 0, s = 0;
   vi t(n), st(n);
-  auto dfs = [&](auto&& dfs, int u) -> int {
+  auto dfs = [&](auto dfs, int u) -> int {
     int l = t[u] = ++q;
     for (int v : g[u]) {
       int siz = s, lu = 0;

diff --git a/library/graphs/euler_path.hpp b/library/graphs/euler_path.hpp
@@ -16,7 +16,7 @@
 vector<pii> euler_path(auto& g, int m, int s) {
   vi vis(m);
   vector<pii> path;
-  auto dfs = [&](auto&& dfs, int u, int eu) -> void {
+  auto dfs = [&](auto dfs, int u, int eu) -> void {
     while (!empty(g[u])) {
       auto [v, ev] = g[u].back();
       g[u].pop_back();

diff --git a/library/graphs/hopcroft_karp.hpp b/library/graphs/hopcroft_karp.hpp
@@ -43,7 +43,7 @@ struct hopcroft_karp {
         }
       }
       if (!found) break;
-      auto dfs = [&](auto&& dfs, int u) -> bool {
+      auto dfs = [&](auto dfs, int u) -> bool {
         for (int v : g[u]) {
           int w = to_l[v];
           if (w == -1 ||

diff --git a/library/graphs/scc.hpp b/library/graphs/scc.hpp
@@ -11,7 +11,7 @@
 auto scc(const auto& g) {
   int n = sz(g), num_sccs = 0, q = 0, s = 0;
   vi scc_id(n, -1), tin(n), st(n);
-  auto dfs = [&](auto&& dfs, int u) -> int {
+  auto dfs = [&](auto dfs, int u) -> int {
     int low = tin[u] = ++q;
     st[s++] = u;
     for (int v : g[u])

diff --git a/library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp b/library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp
@@ -29,7 +29,7 @@ vector<pii> extra_edges(const auto& g, int num_sccs,
     zero_in[scc_id[v]] = 0;
   }
   vector<bool> vis(num_sccs);
-  auto dfs = [&](auto&& dfs, int u) {
+  auto dfs = [&](auto dfs, int u) {
     if (empty(scc_g[u])) return u;
     for (int v : scc_g[u])
       if (!vis[v]) {

diff --git a/library/graphs/strongly_connected_components/offline_incremental_scc.hpp b/library/graphs/strongly_connected_components/offline_incremental_scc.hpp
@@ -16,7 +16,7 @@ vi offline_incremental_scc(vector<array<int, 2>> eds,
   vi ids(n, -1), joins(m, m), idx(m), vs(n), scc_id;
   iota(all(idx), 0);
   vector<vi> g;
-  auto dnc = [&](auto&& dnc, auto el, auto er, int tl,
+  auto dnc = [&](auto dnc, auto el, auto er, int tl,
                int tr) {
     g.clear();
     int mid = midpoint(tl, tr);

diff --git a/library/graphs/uncommon/bridges.hpp b/library/graphs/uncommon/bridges.hpp
@@ -18,7 +18,7 @@
 auto bridges(const auto& g, int m) {
   int n = sz(g), num_ccs = 0, q = 0, s = 0;
   vi br_id(n, -1), is_br(m), tin(n), st(n);
-  auto dfs = [&](auto&& dfs, int u, int p) -> int {
+  auto dfs = [&](auto dfs, int u, int p) -> int {
     int low = tin[u] = ++q;
     st[s++] = u;
     for (auto [v, e] : g[u])

diff --git a/library/graphs/uncommon/cuts.hpp b/library/graphs/uncommon/cuts.hpp
@@ -19,7 +19,7 @@
 auto cuts(const auto& g, int m) {
   int n = sz(g), num_bccs = 0, q = 0, s = 0;
   vi bcc_id(m, -1), is_cut(n), tin(n), st(m);
-  auto dfs = [&](auto&& dfs, int u, int p) -> int {
+  auto dfs = [&](auto dfs, int u, int p) -> int {
     int low = tin[u] = ++q;
     for (auto [v, e] : g[u]) {
       assert(u != v);

diff --git a/library/trees/edge_cd.hpp b/library/trees/edge_cd.hpp
@@ -15,7 +15,7 @@
 //! @space O(n)
 template<class G> void edge_cd(vector<G>& g, auto f) {
   vi siz(sz(g));
-  auto ctd = [&](auto&& ctd, int u, int p, int m) -> int {
+  auto ctd = [&](auto ctd, int u, int p, int m) -> int {
     siz[u] = 1;
     for (int v : g[u])
       if (v != p) {
@@ -25,7 +25,7 @@ template<class G> void edge_cd(vector<G>& g, auto f) {
     return 2 * siz[u] > m ? siz[p] = m + 1 - siz[u],
                             u : -1;
   };
-  auto dfs = [&](auto&& dfs, int u, int m) -> void {
+  auto dfs = [&](auto dfs, int u, int m) {
     if (m < 2) return;
     u = ctd(ctd, u, u, m);
     int sum = 0;

diff --git a/library/trees/hld.hpp b/library/trees/hld.hpp
@@ -14,7 +14,7 @@ template<bool VALS_EDGES> struct HLD {
   int n;
   vi p, siz, rt, tin;
   HLD(auto& g): n(sz(g)), p(n), siz(n, 1), rt(n), tin(n) {
-    auto dfs1 = [&](auto&& dfs1, int u) -> void {
+    auto dfs1 = [&](auto dfs1, int u) -> void {
       for (int& v : g[u]) {
         erase(g[v], p[v] = u);
         dfs1(dfs1, v);
@@ -24,7 +24,7 @@ template<bool VALS_EDGES> struct HLD {
     };
     dfs1(dfs1, 0);
     int tim = 0;
-    auto dfs2 = [&](auto&& dfs2, int u) -> void {
+    auto dfs2 = [&](auto dfs2, int u) -> void {
       tin[u] = tim++;
       for (int v : g[u]) {
         rt[v] = (v == g[u][0] ? rt[u] : v);

diff --git a/library/trees/lca_rmq.hpp b/library/trees/lca_rmq.hpp
@@ -16,7 +16,7 @@ struct LCA {
   LCA(const auto& g):
     n(sz(g)), tin(n), siz(n, 1), d(n), p(n) {
     vi order;
-    auto dfs = [&](auto&& dfs, int u) -> void {
+    auto dfs = [&](auto dfs, int u) -> void {
       tin[u] = sz(order), order.push_back(u);
       for (int v : g[u])
         if (v != p[u])

diff --git a/library/trees/linear_lca.hpp b/library/trees/linear_lca.hpp
@@ -13,7 +13,7 @@ struct linear_lca {
   linear_lca(const auto& g):
     n(sz(g)), d(n), in(n), asc(n), head(n + 1) {
     vector<pii> order;
-    auto dfs = [&](auto&& dfs, int u, int p) -> void {
+    auto dfs = [&](auto dfs, int u, int p) -> void {
       order.emplace_back(u, p), in[u] = sz(order);
       for (int v : g[u])
         if (v != p) {

diff --git a/library/trees/shallowest_decomp_tree.hpp b/library/trees/shallowest_decomp_tree.hpp
@@ -9,7 +9,7 @@
 //! @space O(n)
 void shallowest(auto& g, auto f) {
   vector<vi> order(bit_width(size(g)));
-  auto dfs = [&](auto&& dfs, int u, int p) -> int {
+  auto dfs = [&](auto dfs, int u, int p) -> int {
     int once = 0, twice = 0;
     for (int v : g[u])
       if (v != p) {

diff --git a/library/trees/tree_lift.hpp b/library/trees/tree_lift.hpp
@@ -11,7 +11,7 @@
 struct tree_lift {
   vi d, p, j;
   tree_lift(const auto& g): d(sz(g)), p(d), j(d) {
-    auto dfs = [&](auto&& dfs, int u) -> void {
+    auto dfs = [&](auto dfs, int u) -> void {
       int up =
         d[u] + d[j[j[u]]] == 2 * d[j[u]] ? j[j[u]] : u;
       for (int v : g[u])

diff --git a/library/trees/uncommon/ladder_decomposition.hpp b/library/trees/uncommon/ladder_decomposition.hpp
@@ -17,7 +17,7 @@ struct ladder {
   //! @space O(n log n) for jmp. Everything else is O(n)
   ladder(const auto& g):
     n(sz(g)), d(n), p(n), leaf(n), idx(n), lad(2 * n) {
-    auto dfs = [&](auto&& dfs, int u) -> void {
+    auto dfs = [&](auto dfs, int u) -> void {
       leaf[u] = u;
       for (int v : g[u])
         if (v != p[u]) {

diff --git a/library/trees/uncommon/linear_kth_par.hpp b/library/trees/uncommon/linear_kth_par.hpp
@@ -21,7 +21,7 @@ template<int KAPPA = 2> struct linear_kth_par {
       jmp[t] = st[max(0, s - KAPPA * (t & -t))];
       t++;
     };
-    auto dfs = [&](auto&& dfs, int u, int p) -> void {
+    auto dfs = [&](auto dfs, int u, int p) -> void {
       int& l = leaf[u] = st[d[u]] = u;
       pos[u] = t;
       calc(d[u]);

diff --git a/library/trees/uncommon/subtree_isomorphism.hpp b/library/trees/uncommon/subtree_isomorphism.hpp
@@ -12,7 +12,7 @@
 auto subtree_iso(const auto& g) {
   vi iso_id(sz(g), -1);
   map<vi, int> hashes;
-  auto dfs = [&](auto&& dfs, int u, int p) -> int {
+  auto dfs = [&](auto dfs, int u, int p) -> int {
     vi ch_ids;
     for (int v : g[u])
       if (v != p) ch_ids.push_back(dfs(dfs, v, u));