# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
901981 | MuhammadSaram | Wall (IOI14_wall) | C++17 | 3050 ms | 248448 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;
const int M = 5e5, inf = 1e6;
int seg[2][M*4],k;
void modify(int ty,int p,int x,int v=1,int s=0,int e=k)
{
if (s+1==e)
{
seg[ty][v]=x;
return;
}
int mid=(s+e)/2,lc=v*2,rc=v*2+1;
if (p<mid)
modify(ty,p,x,lc,s,mid);
else
modify(ty,p,x,rc,mid,e);
if (ty)
seg[ty][v]=min(seg[ty][lc],seg[ty][rc]);
else
seg[ty][v]=max(seg[ty][lc],seg[ty][rc]);
}
int get(int ty,int l,int r,int v=1,int s=0,int e=k)
{
if (r<=s or e<=l)
return ty*inf;
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... |