# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
828011 | jlallas384 | Wall (IOI14_wall) | C++17 | 888 ms | 224608 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>
#include "wall.h"
using namespace std;
struct Seg{
int l,r;
Seg(): l(0), r(100000){}
Seg(int l, int r): l(l), r(r){}
void apply(Seg oth){
if(r < oth.l){
l = r = oth.l;
}else if(oth.r < l){
l = r = oth.r;
}else{
l = max(l, oth.l);
r = min(r, oth.r);
}
}
};
struct Tree{
Tree *lc, *rc;
Seg val;
int l, r;
Tree(int l, int r): l(l), r(r){
if(l == r) val = Seg(0, 0);
else{
int m = (l + r) / 2;
lc = new Tree(l, m), rc = new Tree(m + 1, r);
}
# | 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... |