# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307195 | katearima | Exercise Deadlines (CCO20_day1problem2) | C++14 | 226 ms | 11896 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 <vector>
#include <queue>
using namespace std;
int s[300000],a[300000];
vector <int> v[200005];
priority_queue <int> mx;
int n,i,Ans;
int prev(int u){
return u&(u-1);
}
int next(int u){
return 2*u-(u&(u-1));
}
int sum(int x, int y){
int ans=0;
while(y>0){
ans+=s[y];
y=prev(y);
}
//x--;
while(x>0){
ans-=s[x];
x=prev(x);
}
return ans;
}
void update(int u, long long d){
while (u<=n){
s[u]+=d;
u=next(u);
}
}
main(){
cin>>n;
for(i=1; i<=n; i++){
cin>>a[i];
v[a[i]].push_back(i);
update(i,1);
}
for(i=n; i>0; i--){
for(int j=0; j<v[i].size();j++){
mx.push(v[i][j]);
}
if(mx.size()==0) {
Ans=-1;
break;
}
else{
int near=mx.top();
Ans+=sum(near,n);
//cout<<near<<' '<<n<<' '<<sum(near,n)<<endl;
//cout<<sum(2,4)<<endl;
update(near,-1);
mx.pop();
}
}
cout<<Ans<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |