nits

Author: lrvideckis

library/data_structures_[l,r)/seg_tree_uncommon/wavelet_count_less.hpp

@@ -5,11 +5,11 @@
 int count(int l, int r, ll ub) {
   int res = 0;
   for (int h = sz(bv); h--;) {
-    int l0 = bv[h].cnt(l), r0 = bv[h].cnt(r);
-    if ((~ub >> h) & 1) l = l0, r = r0;
-    else
-      res += r0 - l0, l += bv[h].cnt(n) - l0,
-        r += bv[h].cnt(n) - r0;
+    int x = bv[h].cnt(l), y = bv[h].cnt(r);
+    if ((ub >> h) & 1)
+      res += y - x, l += bv[h].cnt(n) - x,
+        r += bv[h].cnt(n) - y;
+    else l = x, r = y;
   }
   return res;
 }

library/data_structures_[l,r)/seg_tree_uncommon/wavelet_matrix.hpp

@@ -25,11 +25,11 @@ struct wavelet_matrix {
   ll kth(int l, int r, int k) {
     ll res = 0;
     for (int h = sz(bv); h--;) {
-      int l0 = bv[h].cnt(l), r0 = bv[h].cnt(r);
-      if (k < r0 - l0) l = l0, r = r0;
+      int x = bv[h].cnt(l), y = bv[h].cnt(r);
+      if (k < y - x) l = x, r = y;
       else
-        k -= r0 - l0, res |= 1LL << h,
-          l += bv[h].cnt(n) - l0, r += bv[h].cnt(n) - r0;
+        k -= y - x, res += 1LL << h, l += bv[h].cnt(n) - x,
+          r += bv[h].cnt(n) - y;
     }
     return res;
   }