# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1145486 | VMaksimoski008 | Triple Jump (JOI19_jumps) | C++20 | 891 ms | 115520 KiB |
#include <bits/stdc++.h>
#define ar array
//#define int long long
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const ll inf = 1e18;
const int maxn = 1e5 + 5;
struct segment_tree {
struct node {
ll pref, suf, ans;
node(ll a=-5e9, ll b=-5e9) { pref = a; suf = b; ans = a + b; }
};
node merge(node a, node b) {
node res;
res.pref = max(a.pref, b.pref);
res.suf = max(a.suf, b.suf);
res.ans = max({ a.ans, b.ans, a.pref + b.suf });
return res;
}
int n;
vector<node> tree;
# | 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... |