Merge pull request #1370 from NachiaVivias/chmax_add_sum_worst

[testcase] Range Chmin Chmax Add Range Sum Θ(n log^2 n)

Author: maspypy

data_structure/range_chmin_chmax_add_range_sum/gen/issue_1369_log2.cpp

@@ -0,0 +1,151 @@
+#include "random.h"
+#include <iostream>
+#include <tuple>
+#include <vector>
+#include <algorithm>
+#include "../params.h"
+
+using namespace std;
+
+using ll = long long;
+
+vector<ll> get_fib(ll N){
+    vector<ll> fib(N*2+1,1);
+    for(ll i=2; i<=N*2; i++) fib[i] = fib[i-1] + fib[i-2];
+    return fib;
+}
+
+vector<ll> get_hack_sequence(ll N, const vector<ll>& fib){
+    vector<ll> A(fib[N*2]);
+    A[0] = 1;
+    for(ll n=2; n<=N; n++){
+        for(ll k=fib[n*2-2]; k<fib[n*2-2]*2; k++) A[k] = A[k-fib[n*2-2]] - fib[n*2-2];
+        for(ll k=fib[n*2-2]*2; k<fib[n*2]; k++) A[k] = A[k-fib[n*2-1]] - fib[n*2-1];
+        for(ll k=0; k<fib[n*2]; k++) A[k] += fib[n*2];
+        A[fib[n*2-2]-1] = fib[n*2-1];
+        A[fib[n*2]-1] = 0;
+    }
+    return A;
+}
+
+vector<ll> get_hack_sequence_transitions(ll N, const vector<ll>& fib, vector<ll> A){
+    vector<ll> chmax_affects;
+
+    for(ll k=0; k<fib[N*2-1]; k++) A[k] -= fib[N*2-2];
+    for(ll k=fib[N*2-1]; k<fib[N*2]; k++) A[k] += fib[N*2-1];
+    for(ll k=0; k<fib[N*2]; k++) if(A[k] <= fib[N*2-1]) chmax_affects.push_back(A[k]);
+    for(ll k=0; k<fib[N*2]; k++) A[k] = max(A[k], fib[N*2-1]);
+
+    sort(chmax_affects.begin(), chmax_affects.end());
+    chmax_affects.erase(unique(chmax_affects.begin(), chmax_affects.end()), chmax_affects.end());
+
+    A[fib[N*2-1]-1] = 0;
+
+    rotate(A.begin(), A.begin() + fib[N*2-1], A.end());
+    return chmax_affects;
+}
+
+struct Query {
+    ll ty, l, r, x;
+};
+
+struct Problem {
+    vector<ll> initial;
+    vector<Query> queries;
+};
+
+Problem get_hack_query_sequence(ll max_n, ll max_q, ll K, ll hack_interval_lg2){
+    ll hack_interval = 1ll << hack_interval_lg2;
+    
+    auto fib = get_fib(K);
+    auto hack_seq = get_hack_sequence(K, fib);
+    auto tr = get_hack_sequence_transitions(K, fib, hack_seq);
+
+    ll hack_len = hack_seq.size();
+    ll hack_binsize = 1; while(hack_binsize < hack_len) hack_binsize *= 2;
+
+
+    ll N = hack_len;
+    ll interval_num = 1;
+    while(N + hack_interval < max_n){
+        interval_num += 1;
+        N += hack_interval;
+    }
+
+    vector<ll> A(N, tr.back());
+    for(ll u=0; u<interval_num; u++){
+        for(ll v=0; v<hack_len; v++){
+            A[u*hack_interval+v] = hack_seq[v];
+        }
+    }
+
+    vector<Query> queries;
+    auto push = [&](Query q){
+        if((ll)queries.size() == max_q) return;
+        queries.push_back(q);
+    };
+
+    ll cy = 0;
+    while((ll)queries.size() < max_q){
+
+        if(cy < fib[K*2-2]){
+            push({ 2, 0, N, fib[K*2-1] });
+            for(ll offset=0; offset<interval_num*hack_interval; offset+=hack_interval){
+                push({ 2, offset + cy, offset + (cy + fib[K*2-1]) % hack_len, -fib[K*2] });
+            }
+        } else {
+            push({ 2, 0, N, -fib[K*2-2] });
+            for(ll offset=0; offset<interval_num*hack_interval; offset+=hack_interval){
+                push({ 2, offset + (cy + fib[K*2-1]) % hack_len, offset + cy, fib[K*2] });
+            }
+        }
+
+        for(ll t=1; t<(ll)tr.size(); t++){
+            push({ 1, 0, N, tr[t] });
+        }
+
+        for(ll offset=0; offset<interval_num*hack_interval; offset+=hack_interval){
+            ll zeroing_pos = (cy + fib[K*2-1] - 1) % hack_len;
+            push({ 0, offset + zeroing_pos, offset + zeroing_pos + 1, 0 });
+        }
+
+        cy = (cy + fib[K*2-1]) % hack_len;
+    }
+
+    return { A, queries };
+}
+
+int main(int, char* argv[]) {
+    long long seed = atoll(argv[1]);
+    auto gen = Random(seed);
+
+    ll num_sumquery = N_AND_Q_MAX / 100;
+    
+    Problem problem = get_hack_query_sequence(N_AND_Q_MAX, N_AND_Q_MAX - num_sumquery, 5 + seed % 2 * 2, 15 - seed / 2 * 2);
+
+    ll N = problem.initial.size();
+    ll Q = problem.queries.size() + num_sumquery;
+
+    vector<ll> query_type(Q);
+    for(ll i : gen.choice<ll>(num_sumquery, 0, Q-1)) query_type[i] = 1;
+    ll hack_query_ptr = 0;
+
+    printf("%lld %lld\n", N, Q);
+
+    for(ll i=0; i<N; i++){
+        if(i) printf(" ");
+        printf("%lld", problem.initial[i]);
+    } printf("\n");
+
+    for(ll i=0; i<Q; i++){
+        if(query_type[i] == 0){
+            Query q = problem.queries[hack_query_ptr++];
+            printf("%lld %lld %lld %lld\n", q.ty, q.l, q.r, q.x);
+        } else {
+            auto [l,r] = gen.uniform_pair<ll>(0, N);
+            printf("3 %lld %lld\n", l, r);
+        }
+    }
+
+    return 0;
+}

data_structure/range_chmin_chmax_add_range_sum/hash.json

@@ -1,6 +1,14 @@
 {
   "example_00.in": "8691e362b7409e5566abe9cdf2ba2d1659b46edef70dabbe485f750c3f185cfc",
   "example_00.out": "a98cad4d512832ba33f51cab84fb6a1a91ebccda726f28a96b95fbb5eb04caba",
+  "issue_1369_log2_00.in": "47566a7b9ba63dc64770ad583a305aee7809af1064a6166e5ce3329b3d10faef",
+  "issue_1369_log2_00.out": "81d4aadacd9bf414e181206afe5e1c725b3f2e771d52fcaafd997c248cafce52",
+  "issue_1369_log2_01.in": "93f8a1806e44435903d5d2ab882f345113d8bf6382dc87982d7cdec5be03cd95",
+  "issue_1369_log2_01.out": "6da2226112cd90f9e239d8498cd081557b5eae9f32d600b26c12330f1316c0ac",
+  "issue_1369_log2_02.in": "5772b9f4be3f8463a72838c9f936fc030d17f9f3546c91861a306abeb214f152",
+  "issue_1369_log2_02.out": "e82c67ddcc9260f0274a94a618a80e6db0093becc5fab7c3c76ef7355399b2f7",
+  "issue_1369_log2_03.in": "7eabe75c8fd7b1bc85eeeee14d61910c24924b39fbfe1d8e0dd5d527bbc0d91b",
+  "issue_1369_log2_03.out": "2faaaa019455bd3cc01f941f0933d71775019dce54a0d569b664a8ac20dc7f7e",
   "max_random_00.in": "88ef2e3d9ff2762f1cacf7c015dd448eef36f1a3d6141f78dafcab1e46371119",
   "max_random_00.out": "5be67565dff85860d6424d3e12cd0ed863299d57e711927a6db9bb981daa4136",
   "max_random_01.in": "93aa493b7b14c24900b948662dde55df110a4af05be9024cf765a05c3bc36129",

data_structure/range_chmin_chmax_add_range_sum/info.toml

@@ -26,6 +26,9 @@ forum = "https://github.com/yosupo06/library-checker-problems/issues/243"
 [[tests]]
     name = "small_absolute_values.cpp"
     number = 3
+[[tests]]
+    name = "issue_1369_log2.cpp"
+    number = 4
 
 [[solutions]]
     name = "correct_with_assert.cpp"