問題追加 range set equal range query

data_structure/range_set_equal_range_query/checker.cpp

@@ -0,0 +1,62 @@
+// https://github.com/MikeMirzayanov/testlib/blob/master/checkers/wcmp.cpp
+
+// The MIT License (MIT)
+
+// Copyright (c) 2015 Mike Mirzayanov
+
+// Permission is hereby granted, free of charge, to any person obtaining a copy
+// of this software and associated documentation files (the "Software"), to deal
+// in the Software without restriction, including without limitation the rights
+// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+// copies of the Software, and to permit persons to whom the Software is
+// furnished to do so, subject to the following conditions:
+
+// The above copyright notice and this permission notice shall be included in all
+// copies or substantial portions of the Software.
+
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+// SOFTWARE.
+
+#include "testlib.h"
+
+using namespace std;
+
+int main(int argc, char * argv[])
+{
+    setName("compare sequences of tokens");
+    registerTestlibCmd(argc, argv);
+
+    int n = 0;
+    string j, p;
+
+    while (!ans.seekEof() && !ouf.seekEof()) 
+    {
+        n++;
+
+        ans.readWordTo(j);
+        ouf.readWordTo(p);
+
+        if (j != p)
+            quitf(_wa, "%d%s words differ - expected: '%s', found: '%s'", n, englishEnding(n).c_str(), compress(j).c_str(), compress(p).c_str());
+    }
+
+    if (ans.seekEof() && ouf.seekEof())
+    {
+        if (n == 1)
+            quitf(_ok, "\"%s\"", compress(j).c_str());
+        else
+            quitf(_ok, "%d tokens", n);
+    }
+    else
+    {
+        if (ans.seekEof())
+            quitf(_wa, "Participant output contains extra tokens");
+        else
+            quitf(_wa, "Unexpected EOF in the participants output");
+    }
+}

data_structure/range_set_equal_range_query/gen/example_00.in

@@ -0,0 +1,14 @@
+8 12
+2 2 3 3 3 4 3 3
+1 0
+1 1
+1 2
+1 3
+1 4
+1 5
+1 6
+1 7
+0 3 5 2
+1 3
+0 1 6 3
+1 3

data_structure/range_set_equal_range_query/gen/fragment.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+#include <tuple>
+#include "../params.h"
+#include "random.h"
+
+using namespace std;
+
+int main(int, char* argv[]) {
+  long long caseid = atoll(argv[1]);
+  long long seed = caseid + 100;
+  auto gen = Random(seed);
+
+  int n = N_AND_Q_MAX;
+  int q = N_AND_Q_MAX;
+
+  printf("%d %d\n", n, q);
+  for (int i = 0; i < n; i++) {
+    if (i) printf(" ");
+    int a = gen.uniform<int>(1, A_MAX);
+    printf("%d", a);
+  }
+  printf("\n");
+  for (int i = 0; i < q; i++) {
+    int t = gen.uniform(0, 1);
+    printf("%d ", t);
+    if (t == 0) {
+      int l = -1;
+      int r = -1;
+      int x = gen.uniform<int>(1, A_MAX);
+      while (l == -1 || n < r) {
+        l = gen.uniform(0, n);
+        r = l + gen.uniform(1, 10);
+      }
+      printf("%d %d %d\n", l, r, x);
+    } else {
+      int i = gen.uniform<int>(0, n - 1);
+      printf("%d\n", i);
+    }
+  }
+  return 0;
+}

data_structure/range_set_equal_range_query/gen/max_random.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <tuple>
+#include "../params.h"
+#include "random.h"
+
+using namespace std;
+
+int main(int, char* argv[]) {
+  long long seed = atoll(argv[1]);
+  auto gen = Random(seed);
+
+  int n = N_AND_Q_MAX;
+  int q = N_AND_Q_MAX;
+  printf("%d %d\n", n, q);
+  for (int i = 0; i < n; i++) {
+    if (i) printf(" ");
+    int a = gen.uniform<int>(1, A_MAX);
+    printf("%d", a);
+  }
+  printf("\n");
+  for (int i = 0; i < q; i++) {
+    int t = gen.uniform(0, 1);
+    printf("%d ", t);
+    if (t == 0) {
+      int l, r;
+      tie(l, r) = gen.uniform_pair(0, n);
+      int x = gen.uniform<int>(1, A_MAX);
+      printf("%d %d %d\n", l, r, x);
+    } else {
+      int i = gen.uniform<int>(0, n - 1);
+      printf("%d\n", i);
+    }
+  }
+  return 0;
+}

data_structure/range_set_equal_range_query/gen/random.cpp

@@ -0,0 +1,35 @@
+#include "random.h"
+#include <iostream>
+#include <tuple>
+#include "../params.h"
+
+using namespace std;
+
+int main(int, char* argv[]) {
+  long long seed = atoll(argv[1]);
+  auto gen = Random(seed);
+
+  int n = gen.uniform<int>(1, N_AND_Q_MAX);
+  int q = gen.uniform<int>(1, N_AND_Q_MAX);
+  printf("%d %d\n", n, q);
+  for (int i = 0; i < n; i++) {
+    if (i) printf(" ");
+    int a = gen.uniform<int>(1, A_MAX);
+    printf("%d", a);
+  }
+  printf("\n");
+  for (int i = 0; i < q; i++) {
+    int t = gen.uniform(0, 1);
+    printf("%d ", t);
+    if (t == 0) {
+      int l, r;
+      tie(l, r) = gen.uniform_pair(0, n);
+      int x = gen.uniform<int>(1, A_MAX);
+      printf("%d %d %d\n", l, r, x);
+    } else {
+      int i = gen.uniform<int>(0, n - 1);
+      printf("%d\n", i);
+    }
+  }
+  return 0;
+}

data_structure/range_set_equal_range_query/gen/slide_window.cpp

@@ -0,0 +1,59 @@
+#include <iostream>
+#include <tuple>
+#include "../params.h"
+#include "random.h"
+
+using namespace std;
+
+int main(int, char* argv[]) {
+  long long caseid = atoll(argv[1]);
+  long long seed = caseid + 200;
+  auto gen = Random(seed);
+
+  int n = N_AND_Q_MAX;
+  int q = N_AND_Q_MAX;
+
+  int slide_stride = 3;
+  int slide_time_interval = 6;
+  int slide_position = 0;
+  int window_width = n / 2;
+  if (caseid == 1) {
+    slide_stride = -3;
+    slide_position = n - window_width;
+  }
+
+  printf("%d %d\n", n, q);
+  for (int i = 0; i < n; i++) {
+    if (i) printf(" ");
+    int a = gen.uniform<int>(1, A_MAX);
+    printf("%d", a);
+  }
+  printf("\n");
+  for (int i = 0; i < q; i++) {
+    if (i % slide_time_interval == 0) {
+      int l = slide_position;
+      int r = l + window_width;
+      int x = gen.uniform<int>(1, A_MAX);
+      printf("0 %d %d %d\n", l, r, x);
+      slide_position += slide_stride;
+    } else {
+      int t = gen.uniform(0, 1);
+      printf("%d ", t);
+      if (t == 0) {
+        // short range
+        int l = -1;
+        int r = -1;
+        int x = gen.uniform<int>(1, A_MAX);
+        while (l == -1 || n < r) {
+          l = gen.uniform(0, n);
+          r = l + gen.uniform(1, 10);
+        }
+        printf("%d %d %d\n", l, r, x);
+      } else {
+        int i = gen.uniform<int>(0, n - 1);
+        printf("%d\n", i);
+      }
+    }
+  }
+  return 0;
+}

data_structure/range_set_equal_range_query/gen/small.cpp

@@ -0,0 +1,35 @@
+#include "random.h"
+#include <iostream>
+#include <tuple>
+#include "../params.h"
+
+using namespace std;
+
+int main(int, char* argv[]) {
+  long long seed = atoll(argv[1]);
+  auto gen = Random(seed);
+
+  int n = seed % 10 + 1;
+  int q = 1000;
+  printf("%d %d\n", n, q);
+  for (int i = 0; i < n; i++) {
+    if (i) printf(" ");
+    int a = gen.uniform<int>(1, 10);
+    printf("%d", a);
+  }
+  printf("\n");
+  for (int i = 0; i < q; i++) {
+    int t = gen.uniform(0, 1);
+    printf("%d ", t);
+    if (t == 0) {
+      int l, r;
+      tie(l, r) = gen.uniform_pair(0, n);
+      int x = gen.uniform<int>(1, 10);
+      printf("%d %d %d\n", l, r, x);
+    } else {
+      int i = gen.uniform<int>(0, n - 1);
+      printf("%d\n", i);
+    }
+  }
+  return 0;
+}

data_structure/range_set_equal_range_query/gen/small_kind.cpp

@@ -0,0 +1,52 @@
+#include <iostream>
+#include <tuple>
+#include "../params.h"
+#include "random.h"
+
+using namespace std;
+
+int main(int, char* argv[]) {
+  long long seed = atoll(argv[1]);
+  auto gen = Random(seed);
+
+  int n = N_AND_Q_MAX;
+  int q = N_AND_Q_MAX;
+  printf("%d %d\n", n, q);
+
+  int www[] = {1, 100, 10000};
+  int kkk[] = {1, 2, 10};
+
+  int w = www[seed / 3];
+  int k = kkk[seed % 3];
+  vector<int> S = gen.choice<int>(k, 1, A_MAX);
+  auto get_a = [&]() -> int {
+    int idx = gen.uniform<int>(0, k - 1);
+    return S[idx];
+  };
+  auto get_lr = [&]() -> pair<int, int> {
+    int l = gen.uniform<int>(0, n - w);
+    int r = l + w;
+    return {l, r};
+  };
+
+  for (int i = 0; i < n; i++) {
+    if (i) printf(" ");
+    int a = get_a();
+    printf("%d", a);
+  }
+  printf("\n");
+  for (int i = 0; i < q; i++) {
+    int t = gen.uniform(0, 1);
+    printf("%d ", t);
+    if (t == 0) {
+      int l, r;
+      tie(l, r) = get_lr();
+      int x = get_a();
+      printf("%d %d %d\n", l, r, x);
+    } else {
+      int i = gen.uniform<int>(0, n - 1);
+      printf("%d\n", i);
+    }
+  }
+  return 0;
+}

data_structure/range_set_equal_range_query/gen/small_random.cpp

@@ -0,0 +1,35 @@
+#include "random.h"
+#include <iostream>
+#include <tuple>
+#include "../params.h"
+
+using namespace std;
+
+int main(int, char* argv[]) {
+  long long seed = atoll(argv[1]);
+  auto gen = Random(seed);
+
+  int n = gen.uniform<int>(1, 2000);
+  int q = gen.uniform<int>(1, 2000);
+  printf("%d %d\n", n, q);
+  for (int i = 0; i < n; i++) {
+    if (i) printf(" ");
+    int a = gen.uniform<int>(1, 100);
+    printf("%d", a);
+  }
+  printf("\n");
+  for (int i = 0; i < q; i++) {
+    int t = gen.uniform(0, 1);
+    printf("%d ", t);
+    if (t == 0) {
+      int l, r;
+      tie(l, r) = gen.uniform_pair(0, n);
+      int x = gen.uniform<int>(1, A_MAX);
+      printf("%d %d %d\n", l, r, x);
+    } else {
+      int i = gen.uniform<int>(0, n - 1);
+      printf("%d\n", i);
+    }
+  }
+  return 0;
+}