# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
898581 | White | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 348 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.
#pragma GCC optimize <"O3">
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
long long red[500005];
int main(){
//ios_base::sync_with_stdio(false);
//cin.tie(NULL);
long long n;
cin>>n;
for(int i=0;i<n;i++)cin>>red[i];
long long L=red[0],br=1,N;
multiset<long long>cur,clr;
for(int i=1;i<n;i++){
long long N=red[i];
//cout<<"L: "<<L<<"_"<<N<<endl;
if(N>=L){
br++;
auto irr=cur.end();
--irr;
long long big=*irr;
auto ir=cur.lower_bound(big-(N-L));
long long ss;
if(ir==cur.begin())ss=0;
else{
--ir;
ss=*ir;
}
//cout<<ss<<endl;
L=N+big-ss;
//L=N;
cur=clr;
}else{
if(cur.empty()){
cur.insert(N);
}else{
auto irr=cur.end();
--irr;
long long big=*irr;
if(big+N<L){
cur.insert(big+N);
}else{
auto ir=cur.lower_bound(big-(L-N));
long long ss;
if(ir==cur.begin())ss=0;
else{
--ir;
ss=*ir;
}
//cout<<ss<<endl;
L=N+big-ss;
br++;
cur=clr;
}
}
}
}
cout<<br<<endl;
return 0;
}
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... |