# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
310849 | mosiashvililuka | Interval Collection (CCO20_day2problem2) | C++17 | 4245 ms | 329724 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;
const int N=2200009;
int a,b,c,d,e,i,j,ii,jj,zx,xc,tes,t,za,seg[N],seg2[N],seg3[N];
char ch;
multiset <int> lf[N],rg[N],mn,mx;
void up(int q){
if(q==0) return;
if(seg[q*2]==-1||seg[q*2+1]==-1){
seg[q]=max(seg[q*2],seg[q*2+1]);
}else{
seg[q]=min(seg[q*2],seg[q*2+1]);
}
seg2[q]=max(seg2[q*2],seg2[q*2+1]);
if(seg3[q*2]==-1||seg3[q*2+1]==-1){
seg3[q]=max(seg3[q*2],seg3[q*2+1]);
}else{
seg3[q]=min(seg3[q*2],seg3[q*2+1]);
}
int qw=seg3[q*2+1]-seg2[q*2];
if(seg3[q*2+1]!=-1&&seg2[q*2]!=-1){
if(seg[q]>qw||seg[q]==-1) seg[q]=qw;
}
up(q/2);
}
void upd(int q){
multiset <int>::iterator it,tt,zit,ztt;
if(lf[q].size()==0||rg[q].size()==0){
seg[q+za-1]=-1;
}else{
# | 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... |