From b7e30b50c41ff898a2150437c9961ffb25ea11c0 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:46:06 -0700 Subject: [PATCH 01/15] remove --- library/data_structures_[l,r)/bit.hpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/library/data_structures_[l,r)/bit.hpp b/library/data_structures_[l,r)/bit.hpp index 5e657eb7..504f0dd1 100644 --- a/library/data_structures_[l,r)/bit.hpp +++ b/library/data_structures_[l,r)/bit.hpp @@ -9,12 +9,12 @@ struct BIT { void update(int i, ll d) { for (; i < sz(s); i |= i + 1) s[i] += d; } - ll query(int r) { // [0, r) + ll query(int r) { ll ret = 0; for (; r > 0; r &= r - 1) ret += s[r - 1]; return ret; } - ll query(int l, int r) { // [l, r) + ll query(int l, int r) { return query(r) - query(l); } #include "bit_uncommon/walk.hpp" From 6fc407ae45e756606ffb184e8afd434f40c1516f Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:46:32 -0700 Subject: [PATCH 02/15] Update lazy_seg_tree.hpp --- library/data_structures_[l,r)/lazy_seg_tree.hpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/library/data_structures_[l,r)/lazy_seg_tree.hpp b/library/data_structures_[l,r)/lazy_seg_tree.hpp index 383a8d08..5da66b7a 100644 --- a/library/data_structures_[l,r)/lazy_seg_tree.hpp +++ b/library/data_structures_[l,r)/lazy_seg_tree.hpp @@ -22,7 +22,7 @@ struct seg_tree { lazy[v] = 0; } } - void update(int l, int r, ll change) { // [l, r) + void update(int l, int r, ll change) { update_impl(l, r, change, 0, n, 1); } void update_impl(int l, int r, ll change, int tl, int tr, @@ -36,7 +36,7 @@ struct seg_tree { update_impl(l, r, change, tm, tr, 2 * v + 1); tree[v] = op(tree[2 * v], tree[2 * v + 1]); } - ll query(int l, int r) { // [l, r) + ll query(int l, int r) { return query_impl(l, r, 0, n, 1); } ll query_impl(int l, int r, int tl, int tr, int v) { From 66c688557d0052fd0cdf0b143f5fdbfb98037a65 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:46:49 -0700 Subject: [PATCH 03/15] Update rmq.hpp --- library/data_structures_[l,r)/rmq.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/library/data_structures_[l,r)/rmq.hpp b/library/data_structures_[l,r)/rmq.hpp index cd96d87c..ffd78c72 100644 --- a/library/data_structures_[l,r)/rmq.hpp +++ b/library/data_structures_[l,r)/rmq.hpp @@ -21,7 +21,7 @@ template struct RMQ { begin(dp[i + 1]), op); } } - T query(int l, int r) { // [l, r) + T query(int l, int r) { assert(l < r); int lg = __lg(r - l); return op(dp[lg][l], dp[lg][r - (1 << lg)]); From 066c0e80c5ff8a6ccc5198c86f0b00e8da9d9210 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:47:07 -0700 Subject: [PATCH 04/15] Update seg_tree.hpp --- library/data_structures_[l,r)/seg_tree.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/library/data_structures_[l,r)/seg_tree.hpp b/library/data_structures_[l,r)/seg_tree.hpp index 6d2d781a..be34b3bf 100644 --- a/library/data_structures_[l,r)/seg_tree.hpp +++ b/library/data_structures_[l,r)/seg_tree.hpp @@ -19,7 +19,7 @@ template struct tree { for (s[i += n] = val; i /= 2;) s[i] = op(s[2 * i], s[2 * i + 1]); } - T query(int l, int r) { // [l, r) + T query(int l, int r) { T x = unit, y = unit; for (l += n, r += n; l < r; l /= 2, r /= 2) { if (l % 2) x = op(x, s[l++]); From 54118a25bd4a5a1fd31a5b155def9cc39f155813 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:48:00 -0700 Subject: [PATCH 05/15] Fix typo in comment for walk function --- library/data_structures_[l,r)/bit_uncommon/walk.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/library/data_structures_[l,r)/bit_uncommon/walk.hpp b/library/data_structures_[l,r)/bit_uncommon/walk.hpp index 516c780d..375286b9 100644 --- a/library/data_structures_[l,r)/bit_uncommon/walk.hpp +++ b/library/data_structures_[l,r)/bit_uncommon/walk.hpp @@ -1,5 +1,5 @@ //! Requires sum of [i,i] >= 0 -//! Returns min r st sum of [0,r] >= sum +//! Returns min r s.t. sum of [0,r] >= sum //! Returns n if sum of [0,n-1] < sum int walk(ll sum) { if (sum <= 0) return -1; From d1802a55ffbdce1a2f5d7c6a60e9fc9f6a345ed3 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:49:04 -0700 Subject: [PATCH 06/15] Remove comments from update and query functions --- library/data_structures_[l,r)/seg_tree_uncommon/implicit.hpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/library/data_structures_[l,r)/seg_tree_uncommon/implicit.hpp b/library/data_structures_[l,r)/seg_tree_uncommon/implicit.hpp index 76a6570b..3d2648c4 100644 --- a/library/data_structures_[l,r)/seg_tree_uncommon/implicit.hpp +++ b/library/data_structures_[l,r)/seg_tree_uncommon/implicit.hpp @@ -35,7 +35,7 @@ template struct implicit_seg_tree { tree[v].lazy = 0; } } - void update(int l, int r, ll add) { // [l, r) + void update(int l, int r, ll add) { update(l, r, add, root_l, root_r, 0); } void update(int l, int r, ll add, int tl, int tr, @@ -49,7 +49,7 @@ template struct implicit_seg_tree { tree[v].num = op(tree[tree[v].lch].num, tree[tree[v].rch].num); } - dt query(int l, int r) { // [l, r) + dt query(int l, int r) { return query(l, r, root_l, root_r, 0); } dt query(int l, int r, int tl, int tr, int v) { From afbf7bd2738fd441184c586f3e163f37c5edf81e Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:49:53 -0700 Subject: [PATCH 07/15] Update persistent.hpp --- library/data_structures_[l,r)/seg_tree_uncommon/persistent.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/library/data_structures_[l,r)/seg_tree_uncommon/persistent.hpp b/library/data_structures_[l,r)/seg_tree_uncommon/persistent.hpp index 722aa780..fff76aeb 100644 --- a/library/data_structures_[l,r)/seg_tree_uncommon/persistent.hpp +++ b/library/data_structures_[l,r)/seg_tree_uncommon/persistent.hpp @@ -41,7 +41,7 @@ struct PST { rch); return sz(tree) - 1; } - ll query(int l, int r, int version) { // [l, r) + ll query(int l, int r, int version) { return query_impl(l, r, root_l, root_r, roots[version]); } From 3810baadd508d5b559f14813a7c0583c0dd3cd62 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:52:16 -0700 Subject: [PATCH 08/15] Refactor query functions in bit.hpp --- library/data_structures_[l,r]/bit.hpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/library/data_structures_[l,r]/bit.hpp b/library/data_structures_[l,r]/bit.hpp index 600bf89f..72a77a7c 100644 --- a/library/data_structures_[l,r]/bit.hpp +++ b/library/data_structures_[l,r]/bit.hpp @@ -9,12 +9,12 @@ struct BIT { void update(int i, ll d) { for (; i < sz(s); i |= i + 1) s[i] += d; } - ll query(int i) { // [0, i] + ll query(int i) { ll ret = 0; for (; i >= 0; (i &= i + 1)--) ret += s[i]; return ret; } - ll query(int l, int r) { // [l, r] + ll query(int l, int r) { return query(r) - query(l - 1); } #include "../data_structures_[l,r)/bit_uncommon/walk.hpp" From de6d08e5d83f00f2590b57f9ea4a0a6874c504e5 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:52:31 -0700 Subject: [PATCH 09/15] Refactor query method to improve readability --- library/data_structures_[l,r]/disjoint_rmq.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/library/data_structures_[l,r]/disjoint_rmq.hpp b/library/data_structures_[l,r]/disjoint_rmq.hpp index c7886ca1..5df9ac63 100644 --- a/library/data_structures_[l,r]/disjoint_rmq.hpp +++ b/library/data_structures_[l,r]/disjoint_rmq.hpp @@ -25,7 +25,7 @@ template struct disjoint_rmq { } } } - T query(int l, int r) { // [l, r] + T query(int l, int r) { if (l == r) return dp[0][l]; int lg = __lg(l ^ r); return op(dp[lg][l], dp[lg][r]); From b8f41d405444ebebf863831f301ff0fa36bea968 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:53:04 -0700 Subject: [PATCH 10/15] Remove comments from update and query methods --- library/data_structures_[l,r]/lazy_seg_tree.hpp | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/library/data_structures_[l,r]/lazy_seg_tree.hpp b/library/data_structures_[l,r]/lazy_seg_tree.hpp index 411e27b0..6082a0c8 100644 --- a/library/data_structures_[l,r]/lazy_seg_tree.hpp +++ b/library/data_structures_[l,r]/lazy_seg_tree.hpp @@ -22,7 +22,7 @@ struct seg_tree { lazy[v] = 0; } } - void update(int l, int r, ll change) { // [l, r] + void update(int l, int r, ll change) { update_impl(l, r, change, 0, n - 1, 1); } void update_impl(int l, int r, ll change, int tl, int tr, @@ -36,7 +36,7 @@ struct seg_tree { update_impl(l, r, change, tm + 1, tr, 2 * v + 1); tree[v] = op(tree[2 * v], tree[2 * v + 1]); } - ll query(int l, int r) { // [l, r] + ll query(int l, int r) { return query_impl(l, r, 0, n - 1, 1); } ll query_impl(int l, int r, int tl, int tr, int v) { From 3bca96fdba0cf16394351b6d5f6e97827670dd6b Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:53:20 -0700 Subject: [PATCH 11/15] Refactor idx function in linear_rmq.hpp --- library/data_structures_[l,r]/linear_rmq.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/library/data_structures_[l,r]/linear_rmq.hpp b/library/data_structures_[l,r]/linear_rmq.hpp index bd98626b..2f650f78 100644 --- a/library/data_structures_[l,r]/linear_rmq.hpp +++ b/library/data_structures_[l,r]/linear_rmq.hpp @@ -33,7 +33,7 @@ template struct linear_rmq { rep(i, 1, n) asc[i] = (asc[i] | asc[i - 1]) & -(in[i] & -in[i]); } - int idx(int l, int r) { // [l, r] + int idx(int l, int r) { if (unsigned j = in[l] ^ in[r]; j) { j = asc[l] & asc[r] & -bit_floor(j); if (unsigned k = asc[l] ^ j; k) From d94896be23f6a6d85f53e625752dc6a18efd0225 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:53:35 -0700 Subject: [PATCH 12/15] Fix formatting of query function in rmq.hpp --- library/data_structures_[l,r]/rmq.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/library/data_structures_[l,r]/rmq.hpp b/library/data_structures_[l,r]/rmq.hpp index 79f22b83..b7d58b9f 100644 --- a/library/data_structures_[l,r]/rmq.hpp +++ b/library/data_structures_[l,r]/rmq.hpp @@ -21,7 +21,7 @@ template struct RMQ { begin(dp[i + 1]), op); } } - T query(int l, int r) { // [l, r] + T query(int l, int r) { assert(l <= r); int lg = __lg(r - l + 1); return op(dp[lg][l], dp[lg][r - (1 << lg) + 1]); From 7718bf6feecb8af6298629748448586094ffb545 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 02:53:55 -0700 Subject: [PATCH 13/15] Refactor query function in seg_tree.hpp Fix formatting and improve query function readability. --- library/data_structures_[l,r]/seg_tree.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/library/data_structures_[l,r]/seg_tree.hpp b/library/data_structures_[l,r]/seg_tree.hpp index fd9e4ca8..ff2e77f2 100644 --- a/library/data_structures_[l,r]/seg_tree.hpp +++ b/library/data_structures_[l,r]/seg_tree.hpp @@ -24,7 +24,7 @@ template struct tree { for (s[i += n] = val; i /= 2;) s[i] = op(s[2 * i], s[2 * i + 1]); } - T query(int l, int r) { // [l, r] + T query(int l, int r) { T res = s[nxt(l += n, r += n)]; while (l <= r) res = op(res, s[nxt(l, r)]); return res; From d794577be4f3490442bec639ee9a6ebe24bd7d75 Mon Sep 17 00:00:00 2001 From: GitHub Date: Sun, 18 Jan 2026 11:02:31 +0000 Subject: [PATCH 14/15] [auto-verifier] verify commit 7718bf6feecb8af6298629748448586094ffb545 --- .verify-helper/timestamps.remote.json | 114 +++++++++++++------------- 1 file changed, 57 insertions(+), 57 deletions(-) diff --git a/.verify-helper/timestamps.remote.json b/.verify-helper/timestamps.remote.json index 5b8c8d44..89700116 100644 --- a/.verify-helper/timestamps.remote.json +++ b/.verify-helper/timestamps.remote.json @@ -4,49 +4,49 @@ "tests/library_checker_aizu_tests/convolution/min_plus_convolution.test.cpp": "2024-11-17 14:04:03 -0600", "tests/library_checker_aizu_tests/data_structures/binary_search_example.test.cpp": "2024-11-18 10:51:39 -0600", "tests/library_checker_aizu_tests/data_structures/binary_trie.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/bit.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/bit_inc.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/bit_rupq.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/bit_rurq.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/bit_walk.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/data_structures/bit.test.cpp": "2026-01-18 02:48:00 -0700", +"tests/library_checker_aizu_tests/data_structures/bit_inc.test.cpp": "2026-01-18 02:52:16 -0700", +"tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp": "2026-01-18 02:52:16 -0700", +"tests/library_checker_aizu_tests/data_structures/bit_rupq.test.cpp": "2026-01-18 02:48:00 -0700", +"tests/library_checker_aizu_tests/data_structures/bit_rurq.test.cpp": "2026-01-18 02:48:00 -0700", +"tests/library_checker_aizu_tests/data_structures/bit_walk.test.cpp": "2026-01-18 02:48:00 -0700", "tests/library_checker_aizu_tests/data_structures/deque.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/data_structures/deque_index.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/data_structures/deque_op.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/data_structures/deque_sliding_window.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc_lines.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc_sum.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/distinct_query.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc.test.cpp": "2026-01-18 02:52:31 -0700", +"tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc_lines.test.cpp": "2026-01-18 02:52:31 -0700", +"tests/library_checker_aizu_tests/data_structures/disjoint_rmq_inc_sum.test.cpp": "2026-01-18 02:52:31 -0700", +"tests/library_checker_aizu_tests/data_structures/distinct_query.test.cpp": "2026-01-18 02:49:53 -0700", "tests/library_checker_aizu_tests/data_structures/dsu.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/data_structures/dsu_bipartite.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/data_structures/dsu_restorable.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/dsu_segtree_undo_trick.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/implicit_seg_tree.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/data_structures/dsu_segtree_undo_trick.test.cpp": "2026-01-18 02:46:32 -0700", +"tests/library_checker_aizu_tests/data_structures/implicit_seg_tree.test.cpp": "2026-01-18 02:49:04 -0700", "tests/library_checker_aizu_tests/data_structures/kruskal_tree_aizu.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/kth_smallest_pst.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/data_structures/kth_smallest_pst.test.cpp": "2026-01-18 02:49:53 -0700", "tests/library_checker_aizu_tests/data_structures/kth_smallest_wavelet_matrix.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/lazy_segment_tree.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_constructor.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_inc.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_inc_constructor.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/line_tree_aizu.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/data_structures/lazy_segment_tree.test.cpp": "2026-01-18 02:46:32 -0700", +"tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_constructor.test.cpp": "2026-01-18 02:46:32 -0700", +"tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_inc.test.cpp": "2026-01-18 02:53:04 -0700", +"tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_inc_constructor.test.cpp": "2026-01-18 02:53:04 -0700", +"tests/library_checker_aizu_tests/data_structures/line_tree_aizu.test.cpp": "2026-01-18 02:46:49 -0700", "tests/library_checker_aizu_tests/data_structures/line_tree_lib_checker.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/data_structures/merge_sort_tree.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/data_structures/mode_query.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/permutation_tree.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/persistent_queue_tree.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/persistent_seg_tree.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/data_structures/permutation_tree.test.cpp": "2026-01-18 02:53:20 -0700", +"tests/library_checker_aizu_tests/data_structures/persistent_queue_tree.test.cpp": "2026-01-18 02:49:53 -0700", +"tests/library_checker_aizu_tests/data_structures/persistent_seg_tree.test.cpp": "2026-01-18 02:49:53 -0700", "tests/library_checker_aizu_tests/data_structures/pq_ds_undo_sliding_window.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/data_structures/pq_ds_undo_with_dsu.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/data_structures/range_parallel_dsu.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/rmq_linear.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/rmq_sparse_table.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/rmq_sparse_table_inc.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/simple_tree.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/simple_tree_inc.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/simple_tree_inc_line.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/data_structures/simple_tree_line.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/data_structures/rmq_linear.test.cpp": "2026-01-18 02:53:20 -0700", +"tests/library_checker_aizu_tests/data_structures/rmq_sparse_table.test.cpp": "2026-01-18 02:53:20 -0700", +"tests/library_checker_aizu_tests/data_structures/rmq_sparse_table_inc.test.cpp": "2026-01-18 02:53:35 -0700", +"tests/library_checker_aizu_tests/data_structures/simple_tree.test.cpp": "2026-01-18 02:47:07 -0700", +"tests/library_checker_aizu_tests/data_structures/simple_tree_inc.test.cpp": "2026-01-18 02:53:55 -0700", +"tests/library_checker_aizu_tests/data_structures/simple_tree_inc_line.test.cpp": "2026-01-18 02:53:55 -0700", +"tests/library_checker_aizu_tests/data_structures/simple_tree_line.test.cpp": "2026-01-18 02:47:07 -0700", "tests/library_checker_aizu_tests/flow/dinic_aizu.test.cpp": "2024-11-17 14:04:03 -0600", "tests/library_checker_aizu_tests/flow/hungarian.test.cpp": "2024-11-17 14:04:03 -0600", "tests/library_checker_aizu_tests/flow/min_cost_max_flow.test.cpp": "2024-12-05 10:41:42 -0600", @@ -67,23 +67,23 @@ "tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp": "2026-01-17 13:05:42 -0700", "tests/library_checker_aizu_tests/graphs/strongly_connected_components_lib_checker.test.cpp": "2026-01-17 13:05:42 -0700", "tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp": "2026-01-18 02:46:49 -0700", "tests/library_checker_aizu_tests/handmade_tests/dsu.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/handmade_tests/dsu_size.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/handmade_tests/edge_cd_small_trees.test.cpp": "2025-09-07 15:50:55 -0600", "tests/library_checker_aizu_tests/handmade_tests/fib_matrix_expo.test.cpp": "2025-08-28 13:19:16 -0600", "tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp": "2025-08-06 16:18:37 -0600", "tests/library_checker_aizu_tests/handmade_tests/hilbert_mos.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/handmade_tests/manacher.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/handmade_tests/manacher.test.cpp": "2026-01-18 02:46:49 -0700", "tests/library_checker_aizu_tests/handmade_tests/merge_st_and_wavelet.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/handmade_tests/mobius.test.cpp": "2025-02-10 14:50:36 -0700", "tests/library_checker_aizu_tests/handmade_tests/mod_division.test.cpp": "2025-09-07 16:12:35 -0600", "tests/library_checker_aizu_tests/handmade_tests/n_choose_k.test.cpp": "2025-08-28 13:19:16 -0600", -"tests/library_checker_aizu_tests/handmade_tests/permutation_tree_small.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/handmade_tests/rmq_small_n.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/handmade_tests/sa_find_subarray.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/handmade_tests/seg_tree_find.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/handmade_tests/seg_tree_find_small.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/handmade_tests/permutation_tree_small.test.cpp": "2026-01-18 02:53:20 -0700", +"tests/library_checker_aizu_tests/handmade_tests/rmq_small_n.test.cpp": "2026-01-18 02:53:20 -0700", +"tests/library_checker_aizu_tests/handmade_tests/sa_find_subarray.test.cpp": "2026-01-18 02:46:49 -0700", +"tests/library_checker_aizu_tests/handmade_tests/seg_tree_find.test.cpp": "2026-01-18 02:48:00 -0700", +"tests/library_checker_aizu_tests/handmade_tests/seg_tree_find_small.test.cpp": "2026-01-18 02:46:32 -0700", "tests/library_checker_aizu_tests/loops/chooses.test.cpp": "2025-02-10 14:50:36 -0700", "tests/library_checker_aizu_tests/loops/quotients.test.cpp": "2024-11-17 14:04:03 -0600", "tests/library_checker_aizu_tests/loops/submasks.test.cpp": "2025-02-10 14:50:36 -0700", @@ -103,41 +103,41 @@ "tests/library_checker_aizu_tests/math/xor_basis.test.cpp": "2025-08-04 20:35:27 -0600", "tests/library_checker_aizu_tests/math/xor_basis_intersection.test.cpp": "2025-08-04 20:35:27 -0600", "tests/library_checker_aizu_tests/monotonic_stack_related/cartesian_binary_tree.test.cpp": "2025-02-10 14:50:36 -0700", -"tests/library_checker_aizu_tests/monotonic_stack_related/cartesian_k_ary_tree.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/monotonic_stack_related/count_rectangles.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/monotonic_stack_related/max_rect_histogram.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/monotonic_stack_related/cartesian_k_ary_tree.test.cpp": "2026-01-18 02:53:20 -0700", +"tests/library_checker_aizu_tests/monotonic_stack_related/count_rectangles.test.cpp": "2026-01-18 02:53:20 -0700", +"tests/library_checker_aizu_tests/monotonic_stack_related/max_rect_histogram.test.cpp": "2026-01-18 02:53:20 -0700", "tests/library_checker_aizu_tests/strings/kmp.test.cpp": "2025-08-05 19:19:23 -0600", "tests/library_checker_aizu_tests/strings/lcp_array.test.cpp": "2025-08-05 19:19:23 -0600", -"tests/library_checker_aizu_tests/strings/lcp_query_palindrome.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/strings/lcp_query_zfunc.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/strings/lcp_query_palindrome.test.cpp": "2026-01-18 02:46:49 -0700", +"tests/library_checker_aizu_tests/strings/lcp_query_zfunc.test.cpp": "2026-01-18 02:46:49 -0700", "tests/library_checker_aizu_tests/strings/lcs_dp.test.cpp": "2025-08-05 19:19:23 -0600", -"tests/library_checker_aizu_tests/strings/lcs_queries.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/strings/lcs_queries.test.cpp": "2026-01-18 02:48:00 -0700", "tests/library_checker_aizu_tests/strings/lcs_queries_merge_sort_tree.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/strings/manacher.test.cpp": "2025-08-05 19:19:23 -0600", -"tests/library_checker_aizu_tests/strings/multi_matching_bs.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/strings/multi_matching_bs.test.cpp": "2026-01-18 02:46:49 -0700", "tests/library_checker_aizu_tests/strings/prefix_function.test.cpp": "2025-08-05 19:19:23 -0600", -"tests/library_checker_aizu_tests/strings/sa_cmp.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/strings/single_matching_bs.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/strings/suffix_array.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/strings/sa_cmp.test.cpp": "2026-01-18 02:46:49 -0700", +"tests/library_checker_aizu_tests/strings/sa_sort_pairs.test.cpp": "2026-01-18 02:46:49 -0700", +"tests/library_checker_aizu_tests/strings/single_matching_bs.test.cpp": "2026-01-18 02:46:49 -0700", +"tests/library_checker_aizu_tests/strings/suffix_array.test.cpp": "2026-01-18 02:53:20 -0700", "tests/library_checker_aizu_tests/strings/suffix_array_short.test.cpp": "2025-08-05 19:19:23 -0600", "tests/library_checker_aizu_tests/strings/trie.test.cpp": "2026-01-17 12:38:18 -0700", "tests/library_checker_aizu_tests/strings/wildcard_pattern_matching.test.cpp": "2025-08-05 19:19:23 -0600", "tests/library_checker_aizu_tests/trees/count_paths_per_length.test.cpp": "2025-12-11 21:47:53 +0000", -"tests/library_checker_aizu_tests/trees/edge_cd_contour_range_query.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/trees/edge_cd_contour_range_update.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/trees/edge_cd_contour_range_query.test.cpp": "2026-01-18 02:48:00 -0700", +"tests/library_checker_aizu_tests/trees/edge_cd_contour_range_update.test.cpp": "2026-01-18 02:48:00 -0700", "tests/library_checker_aizu_tests/trees/edge_cd_count_paths_per_length.test.cpp": "2025-12-11 21:47:53 +0000", "tests/library_checker_aizu_tests/trees/edge_cd_reroot_dp.test.cpp": "2025-09-07 15:50:55 -0600", -"tests/library_checker_aizu_tests/trees/hld_aizu1.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/trees/hld_aizu2.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/trees/hld_lib_checker_path.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_edges.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_nodes.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/trees/hld_aizu1.test.cpp": "2026-01-18 02:48:00 -0700", +"tests/library_checker_aizu_tests/trees/hld_aizu2.test.cpp": "2026-01-18 02:46:32 -0700", +"tests/library_checker_aizu_tests/trees/hld_lib_checker_path.test.cpp": "2026-01-18 02:48:00 -0700", +"tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_edges.test.cpp": "2026-01-18 02:48:00 -0700", +"tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_nodes.test.cpp": "2026-01-18 02:48:00 -0700", "tests/library_checker_aizu_tests/trees/kth_path_ladder.test.cpp": "2025-12-11 21:47:53 +0000", -"tests/library_checker_aizu_tests/trees/kth_path_linear.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/trees/kth_path_tree_lift.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/trees/lca_all_methods_aizu.test.cpp": "2026-01-18 02:20:40 +0000", -"tests/library_checker_aizu_tests/trees/lca_all_methods_lib_checker.test.cpp": "2026-01-18 02:20:40 +0000", +"tests/library_checker_aizu_tests/trees/kth_path_linear.test.cpp": "2026-01-18 02:46:49 -0700", +"tests/library_checker_aizu_tests/trees/kth_path_tree_lift.test.cpp": "2026-01-18 02:46:49 -0700", +"tests/library_checker_aizu_tests/trees/lca_all_methods_aizu.test.cpp": "2026-01-18 02:46:49 -0700", +"tests/library_checker_aizu_tests/trees/lca_all_methods_lib_checker.test.cpp": "2026-01-18 02:46:49 -0700", "tests/library_checker_aizu_tests/trees/shallowest_aizu_tree_height.test.cpp": "2025-12-11 21:47:53 +0000", "tests/library_checker_aizu_tests/trees/shallowest_lib_checker_tree_path_composite.test.cpp": "2025-12-11 21:47:53 +0000", "tests/library_checker_aizu_tests/trees/subtree_isomorphism.test.cpp": "2025-12-11 21:47:53 +0000" From fa8c884ff8cbe336723a51c02ee744bcb9971778 Mon Sep 17 00:00:00 2001 From: Luke Videckis Date: Sun, 18 Jan 2026 04:08:41 -0700 Subject: [PATCH 15/15] format --- library/data_structures_[l,r)/bit.hpp | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/library/data_structures_[l,r)/bit.hpp b/library/data_structures_[l,r)/bit.hpp index 504f0dd1..29c769b4 100644 --- a/library/data_structures_[l,r)/bit.hpp +++ b/library/data_structures_[l,r)/bit.hpp @@ -14,8 +14,6 @@ struct BIT { for (; r > 0; r &= r - 1) ret += s[r - 1]; return ret; } - ll query(int l, int r) { - return query(r) - query(l); - } + ll query(int l, int r) { return query(r) - query(l); } #include "bit_uncommon/walk.hpp" };