请求加强数据!

P3835 【模板】可持久化平衡树

@[小粉兔](/user/10703)
by hh弟中弟 @ 2024-01-10 17:29:50


https://www.luogu.com.cn/problem/U396628 放一个拍出来的 hack,应该没啥问题。
by naroanah @ 2024-01-10 18:21:41


gen: ```cpp #include<bits/stdc++.h> #define rep(i, l, r) for(int i = (l); i <= (r); i++) #define req(i, r, l) for(int i = (r); i >= (l); i--) #define ll long long #define ull unsigned long long #define pii pair<int, int> #define fi first #define se second #define all(x) begin(x), end(x) using namespace std; constexpr int N = 1e5 + 10, inf = 0x3f3f3f3f, INF = 0x7f7f7f7f, mod = 998244353; constexpr double eps = 1e-9; mt19937 rnd(time(0)); int random(int x) {return rnd() % x + 1;} signed main() { ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0);; int n; n = 2000; cout << n << "\n"; rep(i, 1, n) { int op = random(6), x = random(3), v = i == 1 ? 0 :random(i - 1); cout << v << " " << op << " " << x << "\n"; } return 0; } ```
by naroanah @ 2024-01-10 18:22:19


我去,我这数据是不是可能查到不存在的排名,可能有锅
by naroanah @ 2024-01-10 20:53:03


@[离散小波变换°](/user/68344)
by hh弟中弟 @ 2024-01-10 21:07:19


|