# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163611 | combi1k1 | Triple Jump (JOI19_jumps) | C++14 | 1741 ms | 126968 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;
#define FOR(i,a,b) for(int i = a ; i <= b ; ++i)
#define X first
#define Y second
#define pb push_back
#define ll long long
#define lch i << 1
#define rch i << 1 | 1
#define Unit Node(-2e9,-2e9,-3e9)
const int N = 5e5 + 1;
typedef pair<int,int> ii;
struct Node {
ll L, R, S;
Node(ll l = 0,ll r = 0,ll s = 0) : L(l), R(r), S(s) {}
} tr[N << 2];
Node Spare;
Node operator + (const Node &a,const Node &b) {
# | 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... |