# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169526 | mousebeaver | Triple Jump (JOI19_jumps) | C++20 | 978 ms | 69188 KiB |
#define ll long long
#define subINF numeric_limits<ll>::min()/2
#define pll pair<ll, ll>
#define ppl pair<pll, ll>
#include <bits/stdc++.h>
using namespace std;
ll left(ll i)
{return 2*i;}
ll right(ll i)
{return 2*i+1;}
void push(vector<pll>& s, ll i, vector<ll>& topush)
{
if(left(i) >= (ll) s.size())
return;
topush[left(i)] = max(topush[left(i)], topush[i]);
topush[right(i)] = max(topush[right(i)], topush[i]);
}
void update(vector<pll>& s, ll i, vector<ll>& topush)
{
s[i].second = max(s[i].second, s[i].first+topush[i]);
if(left(i) >= (ll) s.size())
return;
push(s, i, topush);
# | 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... |