# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
894300 | Olympia | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3050 ms | 221840 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 <iostream>
#include <vector>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <cassert>
#include <algorithm>
using namespace std;
struct Node {
int mx;
int val;
vector<int> v;
Node () {
this->mx = -INT_MAX, this->val = 0;
}
Node(int mx) {
this->mx = mx, this->val = 0;
}
} vec[2 * ((1 << 20) + 7)];
struct SegmentTree {
vector<int> nodes;
int sz;
Node merge(Node &left, Node &right) {
Node ans = {max(left.mx, right.mx)};
ans.val = max(left.val, right.val);
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |