# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
991067 | gggkik | Wall (IOI14_wall) | C++14 | 639 ms | 112904 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 <wall.h>
#include <bits/stdc++.h>
using namespace std;
const int MXN = 2e6+5;
int t[MXN*4], lo[MXN*4], hi[MXN*4];
const int inf = 1e9;
void push(int x,int s,int e){
if(s!=e){
if(lo[x]!=-1e9) {
lo[x*2] = max(lo[x*2],lo[x]);
hi[x*2] = max(hi[x*2],lo[x]);
lo[x*2+1] = max(lo[x*2+1],lo[x]);
hi[x*2+1] = max(hi[x*2+1],lo[x]);
}
if(hi[x]!=1e9){
lo[x*2] = min(lo[x*2],hi[x]);
hi[x*2] = min(hi[x*2],hi[x]);
lo[x*2+1] = min(lo[x*2+1],hi[x]);
hi[x*2+1] = min(hi[x*2+1],hi[x]);
}
}
else {
t[x] = max(t[x],lo[x]);
t[x] = min(t[x],hi[x]);
}
lo[x] = -1e9;
hi[x] = 1e9;
}
void upd(int x,int s,int e,int l,int r,int v,int t){
push(x,s,e);
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... |