oj.uz

Submission #464968

# Submission time Handle Problem Language Result Execution time Memory
464968 2021-08-14T16:42:06 Z JovanB Swap Swap Sort (CCO21_day1problem1) C++17
25 / 25
 2809 ms 116136 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld = long double;

const int N = 100000;
const int Q = 1000000;

int bit[N+5];

void bit_add(int x){
    while(x <= N) bit[x]++, x += x & -x;
}

int bit_get(int x){
    int res = 0;
    while(x) res += bit[x], x -= x & -x;
    return res;
}

vector <int> vec[N+5];

map <int, int> gde[N+5];
vector <ll> inv[N+5];
int a[N+5], niz[N+5], swp[Q+5];
vector <pair <int, int>> qs[N+5];
int cnt[N+5];

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;

    int n, k, qrs;
    cin >> n >> k >> qrs;
    for(int i=1; i<=n; i++){
        cin >> a[i];
        vec[a[i]].push_back(i);
    }
    ll res = 0;
    int added = 0;
    for(int i=1; i<=n; i++){
        for(auto c : vec[i]) res += added - bit_get(c);
        for(auto c : vec[i]) bit_add(c), added++;
    }
    for(int i=1; i<=k; i++) niz[i] = i;
    for(int i=1; i<=k; i++) inv[i].push_back(0);
    for(int i=1; i<=qrs; i++){
        cin >> swp[i];
        int j = swp[i];
        int x = niz[j], y = niz[j+1];
        if(gde[x].count(y) || gde[y].count(x)){
            swap(niz[j], niz[j+1]);
            continue;
        }
        if(vec[x].size() > vec[y].size()) swap(x, y);
        inv[x].push_back(0);
        gde[x][y] = inv[x].size() - 1;
        qs[x].push_back({y, inv[x].size() - 1});
        swap(niz[j], niz[j+1]);
    }
    for(int i=1; i<=n; i++){
        for(auto pr : qs[a[i]]) inv[a[i]][pr.second] += cnt[pr.first];
        cnt[a[i]]++;
    }
    for(int i=1; i<=k; i++) niz[i] = i;
    for(int i=1; i<=qrs; i++){
        int j = swp[i];
        int x = niz[j], y = niz[j+1];
        if(gde[x].count(y)) res += 1LL*vec[x].size()*vec[y].size() - 2*inv[x][gde[x][y]];
        else res += 2*inv[y][gde[y][x]] - 1LL*vec[x].size()*vec[y].size();
        cout << res << "\n";
        swap(niz[j], niz[j+1]);
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 9 ms 12236 KB Output is correct
3 Correct 9 ms 12212 KB Output is correct
4 Correct 10 ms 12208 KB Output is correct
5 Correct 10 ms 12216 KB Output is correct
6 Correct 10 ms 12344 KB Output is correct
7 Correct 11 ms 12492 KB Output is correct
8 Correct 11 ms 12776 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 13576 KB Output is correct
2 Correct 21 ms 13492 KB Output is correct
3 Correct 22 ms 13644 KB Output is correct
4 Correct 23 ms 13772 KB Output is correct
5 Correct 27 ms 14100 KB Output is correct
6 Correct 34 ms 14376 KB Output is correct
7 Correct 35 ms 16736 KB Output is correct
8 Correct 48 ms 19320 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 235 ms 30640 KB Output is correct
2 Correct 238 ms 30564 KB Output is correct
3 Correct 323 ms 31176 KB Output is correct
4 Correct 474 ms 31736 KB Output is correct
5 Correct 610 ms 34324 KB Output is correct
6 Correct 622 ms 34788 KB Output is correct
7 Correct 598 ms 34720 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 11980 KB Output is correct
2 Correct 9 ms 12236 KB Output is correct
3 Correct 9 ms 12212 KB Output is correct
4 Correct 10 ms 12208 KB Output is correct
5 Correct 10 ms 12216 KB Output is correct
6 Correct 10 ms 12344 KB Output is correct
7 Correct 11 ms 12492 KB Output is correct
8 Correct 11 ms 12776 KB Output is correct
9 Correct 21 ms 13576 KB Output is correct
10 Correct 21 ms 13492 KB Output is correct
11 Correct 22 ms 13644 KB Output is correct
12 Correct 23 ms 13772 KB Output is correct
13 Correct 27 ms 14100 KB Output is correct
14 Correct 34 ms 14376 KB Output is correct
15 Correct 35 ms 16736 KB Output is correct
16 Correct 48 ms 19320 KB Output is correct
17 Correct 235 ms 30640 KB Output is correct
18 Correct 238 ms 30564 KB Output is correct
19 Correct 323 ms 31176 KB Output is correct
20 Correct 474 ms 31736 KB Output is correct
21 Correct 610 ms 34324 KB Output is correct
22 Correct 622 ms 34788 KB Output is correct
23 Correct 598 ms 34720 KB Output is correct
24 Correct 653 ms 36004 KB Output is correct
25 Correct 660 ms 37936 KB Output is correct
26 Correct 783 ms 41348 KB Output is correct
27 Correct 984 ms 44568 KB Output is correct
28 Correct 1157 ms 49620 KB Output is correct
29 Correct 1401 ms 58688 KB Output is correct
30 Correct 1511 ms 68288 KB Output is correct
31 Correct 1476 ms 68036 KB Output is correct
32 Correct 484 ms 114952 KB Output is correct
33 Correct 759 ms 35992 KB Output is correct
34 Correct 845 ms 37880 KB Output is correct
35 Correct 997 ms 39948 KB Output is correct
36 Correct 1545 ms 50836 KB Output is correct
37 Correct 2615 ms 101856 KB Output is correct
38 Correct 2809 ms 103696 KB Output is correct
39 Correct 2104 ms 111940 KB Output is correct
40 Correct 1580 ms 83224 KB Output is correct
41 Correct 1520 ms 90048 KB Output is correct
42 Correct 1365 ms 110880 KB Output is correct
43 Correct 1514 ms 110964 KB Output is correct
44 Correct 1639 ms 112464 KB Output is correct
45 Correct 1548 ms 111752 KB Output is correct
46 Correct 1535 ms 84240 KB Output is correct
47 Correct 1704 ms 91320 KB Output is correct
48 Correct 2461 ms 107436 KB Output is correct
49 Correct 2626 ms 108060 KB Output is correct
50 Correct 844 ms 116136 KB Output is correct
51 Correct 840 ms 115604 KB Output is correct
52 Correct 829 ms 115184 KB Output is correct
53 Correct 855 ms 110276 KB Output is correct
54 Correct 869 ms 110272 KB Output is correct
55 Correct 8 ms 12108 KB Output is correct