# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
398493 | nikatamliani | Triple Jump (JOI19_jumps) | C++14 | 1916 ms | 103976 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"
#define ll long long
using namespace std;
template <typename T, typename Lambda>
struct segment_tree {
vector<T> tree;
T neutral;
Lambda join;
int size, real_size;
segment_tree() {}
template <typename L>
segment_tree(int _size, const T &_neutral, const L& f)
: join (f) {
real_size = _size;
size = nxt(_size);
tree = vector<T>(2*size+1);
neutral = _neutral;
}
int nxt(int x) {
int i = 1;
while(i < x) {
i <<= 1;
}
return i;
}
void init(const vector<T> &v) {
for(int i = 0; i < real_size; ++i) {
tree[i + size] = v[i];
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... |