# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158332 | georgerapeanu | Triple Jump (JOI19_jumps) | C++11 | 1633 ms | 85884 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 <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int NMAX = 5e5;
int n,q;
int v[NMAX + 5];
int st[NMAX + 5],len;
vector<int> segments[NMAX + 5];
vector<pair<int,int> > queries[NMAX + 5];
int ans[NMAX + 5];
struct node_t {
int ma_val;
int lazy;
int best_ans;
int offset_min;
int offset_max;
node_t operator + (const node_t &other)const {
node_t ans;
ans.ma_val = max(this->ma_val,other.ma_val);
ans.lazy = 0;
ans.offset_min = min(this->offset_min,other.offset_min);
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... |