test 3d version too now

Author: lrvideckis

tests/library_checker_aizu_tests/handmade_tests/kd_bit.test.cpp

@@ -10,6 +10,11 @@ int main() {
     int m = rnd(1, 100);
     KD_BIT<2> bit(n, m);
     vector<vector<ll>> a(n, vector<ll>(m, 0));
+    for (int i = 0; i < n; i++)
+      for (int j = 0; j < m; j++) {
+        a[i][j] = rnd(INT_MIN, INT_MAX);
+        bit.update(i, j, a[i][j]);
+      }
     for (int events = 0; events < 100; events++) {
       if (events % 2 == 0) {
         int i = rnd(0, n - 1);
@@ -31,6 +36,46 @@ int main() {
       }
     }
   }
+  for (int num_tests = 0; num_tests < 100; num_tests++) {
+    int n = rnd(1, 100);
+    int m = rnd(1, 100);
+    int l = rnd(1, 100);
+    KD_BIT<3> bit(n, m, l);
+    vector<vector<vector<ll>>> a(n,
+      vector<vector<ll>>(m, vector<ll>(l, 0)));
+    for (int i = 0; i < n; i++)
+      for (int j = 0; j < m; j++)
+        for (int k = 0; k < l; k++) {
+          a[i][j][k] = rnd(INT_MIN, INT_MAX);
+          bit.update(i, j, k, a[i][j][k]);
+        }
+    for (int events = 0; events < 100; events++) {
+      if (events % 2 == 0) {
+        int i = rnd(0, n - 1);
+        int j = rnd(0, m - 1);
+        int k = rnd(0, l - 1);
+        ll upd = rnd(INT_MIN, INT_MAX);
+        a[i][j][k] += upd;
+        bit.update(i, j, k, upd);
+      } else {
+        int i1 = rnd(0, n);
+        int j1 = rnd(0, m);
+        int k1 = rnd(0, l);
+        int i2 = rnd(0, n);
+        int j2 = rnd(0, m);
+        int k2 = rnd(0, l);
+        if (i1 > i2) swap(i1, i2);
+        if (j1 > j2) swap(j1, j2);
+        if (k1 > k2) swap(k1, k2);
+        ll naive = 0;
+        for (int i = i1; i < i2; i++)
+          for (int j = j1; j < j2; j++)
+            for (int k = k1; k < k2; k++)
+              naive += a[i][j][k];
+        assert(naive == bit.query(i1, i2, j1, j2, k1, k2));
+      }
+    }
+  }
   cout << "Hello World\n";
   return 0;
 }