update tests

Author: lrvideckis

tests/library_checker_aizu_tests/data_structures/simple_tree_inc.test.cpp

@@ -6,8 +6,7 @@ int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
-  tree st(n, int{}, ranges::min);
-  rep(i, 0, n) st.update(i, INT_MAX);
+  tree st(n, INT_MAX, ranges::min);
   while (q--) {
     int type;
     cin >> type;

tests/library_checker_aizu_tests/data_structures/simple_tree_inc_line.test.cpp

@@ -7,17 +7,14 @@ int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
-  tree st(n, array<int, 2>{},
+  vector<array<int, 2>> a(n);
+  for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1];
+  tree st(a,
     [&](const array<int, 2>& l,
       const array<int, 2>& r) -> array<int, 2> {
       return {int(1LL * l[0] * r[0] % mod),
         int((1LL * r[0] * l[1] + r[1]) % mod)};
     });
-  for (int i = 0; i < n; i++) {
-    int a, b;
-    cin >> a >> b;
-    st.update(i, array<int, 2>{a, b});
-  }
   while (q--) {
     int type;
     cin >> type;