# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
530780 | PoPularPlusPlus | Wall (IOI14_wall) | C++17 | 906 ms | 59260 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;
#include "wall.h"
struct item {
int rem , fin;
};
struct Seg {
int siz;
vector<item> sum;
item nutral = {INT_MAX , 0};
item merge(item a , item b){
item ans;
ans.fin = max(a.fin , min(b.fin , a.rem));
ans.rem = min(a.rem , b.rem);
return ans;
}
void init(int n){
siz = 1;
while(siz < n)siz *= 2;
sum.assign(siz * 2 , nutral);
}
int set(int i , int x , int lx , int rx){
# | 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... |