| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 157063 | keta_tsimakuridze | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 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;
int n,k,b[1000005],a[100005],fix[1000005],B,curans,ret,ans,biT[100005],i;
queue<int> q[300005];
void update(int ind,int val){
// cout<<ind<<endl;
for(int i=ind;i<=n;i+=i&(-i)){
// cout<<i<<"m";
biT[i]=max(biT[i]+val,0); }
}
int getans(int ind2){ ret=0;
for(ind2;ind2>=1;ind2-=ind2&(-ind2)){
ret+=biT[ind2]; }
return ret;
}
int main(){
cin>>n;
for(k=1;k<=n;k++){
cin>>a[k]; q[a[k]+100002].push(k);
update(k,1);
}
for(k=1;k<=n;k++){
curans=0;
if(fix[k]==0){
B=q[(-1)*a[k]+100002].front();
q[(-1)*a[k]+100002].pop();
fix[B]=1;
// cout<<k<<endl;
curans=getans(B)-getans(k+1);
update(B,(-1)*biT[B]);
if(a[k]>0) curans++;
// cout<<"suM"<<" "<<curans<<endl;
q[a[k]+100002].pop();
}
ans+=curans;
}
cout<<ans;
}