use ranges::unique and ranges::partition for full-range calls

Convert the remaining full-range std algorithm calls to their ranges::
equivalents:
- virtual_tree: unique(all(subset)) -> begin(ranges::unique(subset))
- edge_cd: partition(all(g[u]), ...) -> begin(ranges::partition(g[u], ...))

ranges::unique / ranges::partition return a subrange, so begin(...) yields
the iterator the erase / offset logic needs.

Partial-range calls (iterator sub-ranges) and std::partial_sum are still
left as-is: partial_sum has no ranges equivalent, and partial ranges read
more clearly with explicit iterators.

Author: cameroncuster

library/trees/edge_cd.hpp

@@ -30,10 +30,10 @@ template<class G> void edge_cd(vector<G>& g, auto f) {
     if (m < 2) return;
     u = ctd(u, u, m);
     int sum = 0;
-    auto it = partition(all(g[u]), [&](int v) {
+    auto it = begin(ranges::partition(g[u], [&](int v) {
       ll x = sum + s[v];
       return x * x < m * (m - x) ? sum = x : 0;
-    });
+    }));
     f(u, it - begin(g[u]));
     G oth(it, end(g[u]));
     g[u].erase(it, end(g[u]));

library/trees/extra_members/virtual_tree.hpp

@@ -16,7 +16,7 @@ array<vi, 2> compress_tree(vi subset) {
   rep(i, 1, len)
     subset.push_back(lca(subset[i - 1], subset[i]));
   ranges::sort(subset, {}, proj);
-  subset.erase(unique(all(subset)), end(subset));
+  subset.erase(begin(ranges::unique(subset)), end(subset));
   return {
     mono_st(subset,
       [&](int u, int v) { return in_subtree(u, v); }),