# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
985724 | gggkik | Feast (NOI19_feast) | C++14 | 126 ms | 153120 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;
using ll = long long;
using pii = pair<ll,ll>;
const ll inf = 1e18;
const int MXN = 3e5+5;
struct node{
pii l, r; // v, pos
pair<ll,pii> m;
ll a;
}t[MXN<<2], nt[MXN<<2];
int A[MXN], lz[MXN];
node operator+(const node &i, const node &j){
node k;
k.l = max(i.l,{i.a+j.l.first,j.l.second});
k.r = max(j.r,{i.r.first+j.a,i.r.second});
k.m = max(i.m,j.m);
k.m = max(k.m,{i.r.first+j.l.first,{i.r.second,j.l.second}});
k.a = i.a+j.a;
return k;
}
void push(int x,int s,int e){
if(!lz[x]) return;
swap(t[x],nt[x]);
if(s!=e){
lz[x*2] ^= lz[x];
lz[x*2+1] ^= lz[x];
}
lz[x] = 0;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |