# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200115 | gs18115 | Triple Jump (JOI19_jumps) | C++14 | 1221 ms | 138120 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<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define semicolon ;
#define ryan bear
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18;
struct node
{
ll am,bm,sm;
node(ll x=-INF,ll y=-INF):am(x),bm(y),sm(x+y){}
node(ll x,ll y,ll z):am(x),bm(y),sm(z){}
node operator^(node x)
{
return node(max(am,x.am),max(bm,x.bm),max({sm,x.sm,bm+x.am}));
}
};
ll a[500010],b[500010];
struct seg
{
node t[2000010];
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... |