# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313607 | gurkot | Interval Collection (CCO20_day2problem2) | C++14 | 3963 ms | 245100 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 <iostream>
#include <set>
using namespace std;
multiset <int> setl,setr;
multiset <int> msl[1000001],msr[1000001];
struct Node { int maxl,minr,ans;} tree[4000001];
const int TS=1000000;
int q,a,b;
char ch;
void update_L(int u,int a,int b,int pos,int val) {
//cout<<a<<" -L- "<<b<<" u="<<u<<endl;
if(a==b) {
tree[u].maxl=val; tree[u].ans=tree[u].minr-val;
//cout<<"tree_L: ans="<<tree[u].ans<<endl;
//cout<<a<<" -L- "<<b<<" u="<<u<<endl;
return;
}
int c=(a+b)/2;
int l,r;
l=2*u; r=l+1;
if(pos<=c) update_L(l,a,c,pos,val);
else update_L(r, c+1,b,pos,val);
tree[u].maxl=max(tree[l].maxl,tree[r].maxl);
tree[u].minr=min(tree[l].minr,tree[r].minr);
tree[u].ans=min(tree[l].ans,tree[r].ans);
tree[u].ans=min(tree[u].ans,tree[r].minr-tree[l].maxl);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |