# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167584 | antonn | Triple Jump (JOI19_jumps) | C++20 | 134 ms | 42068 KiB |
#include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
template<class T> bool ckmin(T& a, T b) { return b < a ? a = b, true : false; }
template<class T> bool ckmax(T& a, T b) { return a < b ? a = b, true : false; }
const int N = 5e5 + 7;
const int inf = 1e9;
int x[N];
vector<int> add[N];
vector<pi> qs[N];
struct Node {
int maxab;
int maxc;
int res;
};
Node operator + (Node a, Node b) {
Node c;
c.maxab = max(a.maxab, b.maxab);
c.maxc = max(a.maxc, b.maxc);
# | 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... |