# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
306094 | vipghn2003 | Exhibition (JOI19_ho_t2) | C++14 | 5 ms | 6656 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>
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
using namespace std;
const int N=1e5+5;
int n,m,c[N];
pii a[N],f[N],ST[8*N];
void update(int id,int l,int r,int pos,pii val)
{
if(pos<l||pos>r) return ;
if(l==r)
{
ST[id]=max(ST[id],val);
return ;
}
int mid=(l+r)/2;
update(id*2,l,mid,pos,val);
update(id*2+1,mid+1,r,pos,val);
ST[id]=max(ST[id*2],ST[id*2+1]);
}
pii get (int id,int l,int r,int L,int R)
{
if (r<L||R<l) return mp(-1e9,0);
if (L<=l&&r<=R) return ST[id];
int mid=(l+r)/2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |