# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
909983 | Alcabel | Abracadabra (CEOI22_abracadabra) | C++17 | 881 ms | 41624 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(161);
struct Node {
int val, priority, sz, maxVal;
int left, right;
Node() {
left = right = -1;
}
Node(int _val) {
val = _val, sz = 1, maxVal = val;
priority = rnd();
left = right = -1;
}
};
const int maxn = 2e5;
Node treap[maxn];
int getSz(int root) {
if (root == -1) { return 0; }
return treap[root].sz;
}
int getMax(int root) {
if (root == -1) { return 0; }
return treap[root].maxVal;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |