oj.uz

Submission #411675

# Submission time Handle Problem Language Result Execution time Memory
411675 2021-05-25T17:52:22 Z Dormi Swap Swap Sort (CCO21_day1problem1) C++14
25 / 25
 1984 ms 71212 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template <typename T>
int sz(const T &a){return int(a.size());}
const int MN=1e5+1,MB=100;
int arr[MN];
vector<int> locs[MN];
vector<ll> pc[MN];
int ind[MN];
int ord[MN];
ll bit[MN];
int n,k,q;
void update(int loc, ll val){
    for(;loc<=k;loc+=loc&-loc)bit[loc]+=val;
}
ll query(int loc){
    ll res=0;
    for(;loc>0;loc-=loc&-loc)res+=bit[loc];
    return res;
}
int main(int argc, char* argv[]){//bubble sort, count inversions. maintain number of adjacent inversions? sqrt is possible..
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    cin>>n>>k>>q;
    ll tot=0;
    for(int i=1;i<=n;i++){
        cin>>arr[i];
        tot+=query(k)-query(arr[i]);
        update(arr[i],1);
        locs[arr[i]].push_back(i);
    }
    int am=0;
    for(int i=1;i<=k;i++){
        ord[i]=i;
        if(sz(locs[i])>=MB){
            ind[i]=am++;
            for(int j=1;j<=k;j++)pc[j].push_back(0);
            int cnt=0;
            for(int j=1;j<=n;j++){
                if(arr[j]==i)cnt++;
                else{
                    pc[arr[j]].back()+=cnt;
                }
            }
        }
    }
    auto calc=[&](int i){
        int cur=ord[i],pre=ord[i-1];
        ll res=0;
        if(sz(locs[cur])>=MB){
            res+=pc[pre][ind[cur]];
        }
        else if(sz(locs[pre])>=MB){
            res+=ll(sz(locs[pre]))*ll(sz(locs[cur]))-pc[cur][ind[pre]];
        }
        else{
            int ptr=0;
            for(auto x:locs[cur]){
                while(ptr!=sz(locs[pre])&&locs[pre][ptr]<=x)ptr++;
                res+=sz(locs[pre])-ptr;
            }
        }
        return res;
    };
    while(q--){
        int a;
        cin>>a;
        tot-=calc(a+1);
        swap(ord[a+1],ord[a]);
        tot+=calc(a+1);
        printf("%lli\n",tot);
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 5 ms 5068 KB Output is correct
3 Correct 8 ms 5068 KB Output is correct
4 Correct 6 ms 5068 KB Output is correct
5 Correct 11 ms 5068 KB Output is correct
6 Correct 7 ms 5068 KB Output is correct
7 Correct 8 ms 5072 KB Output is correct
8 Correct 6 ms 5196 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 5896 KB Output is correct
2 Correct 15 ms 6120 KB Output is correct
3 Correct 67 ms 6040 KB Output is correct
4 Correct 399 ms 10140 KB Output is correct
5 Correct 21 ms 6220 KB Output is correct
6 Correct 22 ms 6292 KB Output is correct
7 Correct 46 ms 7360 KB Output is correct
8 Correct 30 ms 8548 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 250 ms 16960 KB Output is correct
2 Correct 227 ms 17080 KB Output is correct
3 Correct 241 ms 16960 KB Output is correct
4 Correct 283 ms 17108 KB Output is correct
5 Correct 500 ms 18708 KB Output is correct
6 Correct 585 ms 18992 KB Output is correct
7 Correct 582 ms 18976 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 5 ms 5068 KB Output is correct
3 Correct 8 ms 5068 KB Output is correct
4 Correct 6 ms 5068 KB Output is correct
5 Correct 11 ms 5068 KB Output is correct
6 Correct 7 ms 5068 KB Output is correct
7 Correct 8 ms 5072 KB Output is correct
8 Correct 6 ms 5196 KB Output is correct
9 Correct 14 ms 5896 KB Output is correct
10 Correct 15 ms 6120 KB Output is correct
11 Correct 67 ms 6040 KB Output is correct
12 Correct 399 ms 10140 KB Output is correct
13 Correct 21 ms 6220 KB Output is correct
14 Correct 22 ms 6292 KB Output is correct
15 Correct 46 ms 7360 KB Output is correct
16 Correct 30 ms 8548 KB Output is correct
17 Correct 250 ms 16960 KB Output is correct
18 Correct 227 ms 17080 KB Output is correct
19 Correct 241 ms 16960 KB Output is correct
20 Correct 283 ms 17108 KB Output is correct
21 Correct 500 ms 18708 KB Output is correct
22 Correct 585 ms 18992 KB Output is correct
23 Correct 582 ms 18976 KB Output is correct
24 Correct 1190 ms 25184 KB Output is correct
25 Correct 1513 ms 17072 KB Output is correct
26 Correct 768 ms 17236 KB Output is correct
27 Correct 545 ms 17300 KB Output is correct
28 Correct 432 ms 17612 KB Output is correct
29 Correct 349 ms 18396 KB Output is correct
30 Correct 409 ms 19500 KB Output is correct
31 Correct 397 ms 19492 KB Output is correct
32 Correct 350 ms 33548 KB Output is correct
33 Correct 508 ms 18696 KB Output is correct
34 Correct 554 ms 19000 KB Output is correct
35 Correct 679 ms 22008 KB Output is correct
36 Correct 1253 ms 21076 KB Output is correct
37 Correct 1544 ms 17348 KB Output is correct
38 Correct 1144 ms 17180 KB Output is correct
39 Correct 381 ms 19492 KB Output is correct
40 Correct 420 ms 27420 KB Output is correct
41 Correct 533 ms 46936 KB Output is correct
42 Correct 466 ms 46500 KB Output is correct
43 Correct 549 ms 46548 KB Output is correct
44 Correct 657 ms 71212 KB Output is correct
45 Correct 647 ms 71164 KB Output is correct
46 Correct 708 ms 19268 KB Output is correct
47 Correct 937 ms 19040 KB Output is correct
48 Correct 1984 ms 18408 KB Output is correct
49 Correct 1518 ms 17764 KB Output is correct
50 Correct 340 ms 33184 KB Output is correct
51 Correct 339 ms 32556 KB Output is correct
52 Correct 343 ms 32208 KB Output is correct
53 Correct 356 ms 32644 KB Output is correct
54 Correct 356 ms 32576 KB Output is correct
55 Correct 4 ms 4940 KB Output is correct