# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236644 | kshitij_sodani | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 1617 ms | 75120 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;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
int n;
int it[1000001];
int aa,bb,cc;
int tree[4000001];
int le[1000001];
int ans[1000001];
vector<pair<pair<int,int>,int>> qq[1000001];
void update(int no,int l,int r,int aa,int val){
if(l==r){
tree[no]=val;
}
else{
int mid=(l+r)/2;
if(aa<=mid){
update(no*2+1,l,mid,aa,val);
}
else{
update(no*2+2,mid+1,r,aa,val);
}
tree[no]=max(tree[no*2+1],tree[no*2+2]);
}
}
int query(int no,int l,int r,int aa,int bb){
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |