| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 308740 | NintsiChkhaidze | Exercise Deadlines (CCO20_day1problem2) | C++14 | 121 ms | 13432 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>
#define f first
#define s second
#define pb push_back
#define left (node<<1),l,((l+r)>>1)
#define right ((node<<1)|1),((l+r)>>1) + 1,r
#define N 200001
#define ll long long
using namespace std;
priority_queue <int> q;
int fen[200005];
vector <int> v[200005];
void upd(int in,int val){
    while (in < N){
        fen[in]+=val;
        in += (in&(-in));
    }
}
int get(int in){
    int sum=0;
    while (in > 0){
        sum+=fen[in];
        in -= (in&(-in));
    }
    return sum;
}
int main(){
    int n;
    scanf("%d",&n);
    
    for (int i=1;i<=n;i++){
        int a;
        scanf("%d",&a);
        v[a].pb(i);
    }
 
    int ind = n;
    ll ans = 0;
    while (ind > 0){
        for (int i = 0; i < v[ind].size(); i++)
            q.push(v[ind][i]);
        
        if (q.size() == 0) {ans=-1;  break;}
        int x = q.top() - get(q.top());
        ans+=ind - x;
        upd(q.top(),1);
        q.pop();
        ind--;
    }
    printf("%lld",ans);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
