oj.uz

Submission #423146

# Submission time Handle Problem Language Result Execution time Memory
423146 2021-06-10T18:50:18 Z Osama_Alkhodairy Swap Swap Sort (CCO21_day1problem1) C++17
25 / 25
 2090 ms 53220 KB 
#include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long

const int N = 100001;
const int SQ = 100;

int n, k, q, mp[N], f[N], tree[4 * N];
ll cost[N / SQ][N];
vector <int> a, v[N];

void update(int l, int r, int node, int idx){
    if(r < l || r < idx || l > idx) return;
    if(l == r){
        tree[node]++;
        return;
    }
    int mid = (l + r) / 2;
    update(l, mid, 2 * node, idx);
    update(mid + 1, r, 2 * node + 1, idx);
    tree[node] = tree[2 * node] + tree[2 * node + 1];
}
int query(int l, int r, int node, int s, int e){
    if(r < l || r < s || l > e) return 0;
    if(s <= l && r <= e) return tree[node];
    int mid = (l + r) / 2;
    return query(l, mid, 2 * node, s, e) + query(mid + 1, r, 2 * node + 1, s, e);
}
int calc_small(vector <int> &l, vector <int> &r){
    int ret = 0;
    int pl = 0, pr = 0;
    int cnt = 0;
    while(pl < (int)l.size() || pr < (int)r.size()){
        if(pl == (int)l.size()) pr++;
        else if(pr == (int)r.size()){
            ret += cnt;
            pl++;
        }
        else if(l[pl] < r[pr]){
            ret += cnt;
            pl++;
        }
        else{
            cnt++;
            pr++;
        }
    }
    return ret;
}
ll calc_cost(int x, int y){
    if((int)v[x].size() >= SQ){
        return 1LL * v[x].size() * v[y].size() - cost[mp[x]][y];
    }
    if((int)v[y].size() >= SQ){
        return cost[mp[y]][x];
    }
    return calc_small(v[x], v[y]);
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    memset(mp, -1, sizeof mp);
    cin >> n >> k >> q;
    a.resize(n);
    for(auto &i : a){
        cin >> i;
        i--;
    }
    for(int i = 0 ; i < n ; i++){
        v[a[i]].push_back(i);
    }
    int c = 0;
    for(int i = 0 ; i < k ; i++){
        if((int)v[i].size() >= SQ){
            mp[i] = c++;
            int cnt = 0;
            for(int j = 0 ; j < n ; j++){
                if(a[j] == i) cnt++;
                else cost[mp[i]][a[j]] += cnt;
            }
        }
    }
    for(int i = 0 ; i < k ; i++){
        f[i] = i;
    }
    ll ans = 0;
    for(int i = 0 ; i < n ; i++){
        ans += query(0, k - 1, 1, a[i] + 1, k - 1);
        update(0, k - 1, 1, a[i]);
    }
    for(int i = 0 ; i < q ; i++){
        int j;
        cin >> j;
        j--;
        ans -= calc_cost(f[j], f[j + 1]);
        swap(f[j], f[j + 1]);
        ans += calc_cost(f[j], f[j + 1]);
        cout << ans << "\n";
    }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3020 KB Output is correct
2 Correct 3 ms 3148 KB Output is correct
3 Correct 5 ms 3148 KB Output is correct
4 Correct 4 ms 3276 KB Output is correct
5 Correct 10 ms 3184 KB Output is correct
6 Correct 6 ms 3148 KB Output is correct
7 Correct 6 ms 3148 KB Output is correct
8 Correct 6 ms 3276 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3980 KB Output is correct
2 Correct 19 ms 4360 KB Output is correct
3 Correct 60 ms 4908 KB Output is correct
4 Correct 214 ms 11148 KB Output is correct
5 Correct 46 ms 4676 KB Output is correct
6 Correct 52 ms 4844 KB Output is correct
7 Correct 69 ms 6036 KB Output is correct
8 Correct 69 ms 7372 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 15168 KB Output is correct
2 Correct 199 ms 17260 KB Output is correct
3 Correct 226 ms 17964 KB Output is correct
4 Correct 265 ms 18868 KB Output is correct
5 Correct 389 ms 22672 KB Output is correct
6 Correct 418 ms 23828 KB Output is correct
7 Correct 433 ms 23888 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3020 KB Output is correct
2 Correct 3 ms 3148 KB Output is correct
3 Correct 5 ms 3148 KB Output is correct
4 Correct 4 ms 3276 KB Output is correct
5 Correct 10 ms 3184 KB Output is correct
6 Correct 6 ms 3148 KB Output is correct
7 Correct 6 ms 3148 KB Output is correct
8 Correct 6 ms 3276 KB Output is correct
9 Correct 14 ms 3980 KB Output is correct
10 Correct 19 ms 4360 KB Output is correct
11 Correct 60 ms 4908 KB Output is correct
12 Correct 214 ms 11148 KB Output is correct
13 Correct 46 ms 4676 KB Output is correct
14 Correct 52 ms 4844 KB Output is correct
15 Correct 69 ms 6036 KB Output is correct
16 Correct 69 ms 7372 KB Output is correct
17 Correct 203 ms 15168 KB Output is correct
18 Correct 199 ms 17260 KB Output is correct
19 Correct 226 ms 17964 KB Output is correct
20 Correct 265 ms 18868 KB Output is correct
21 Correct 389 ms 22672 KB Output is correct
22 Correct 418 ms 23828 KB Output is correct
23 Correct 433 ms 23888 KB Output is correct
24 Correct 995 ms 26276 KB Output is correct
25 Correct 1598 ms 19916 KB Output is correct
26 Correct 832 ms 20380 KB Output is correct
27 Correct 620 ms 20804 KB Output is correct
28 Correct 474 ms 21596 KB Output is correct
29 Correct 417 ms 22820 KB Output is correct
30 Correct 399 ms 24216 KB Output is correct
31 Correct 378 ms 24184 KB Output is correct
32 Correct 292 ms 32616 KB Output is correct
33 Correct 389 ms 22596 KB Output is correct
34 Correct 466 ms 23936 KB Output is correct
35 Correct 477 ms 25428 KB Output is correct
36 Correct 1024 ms 25788 KB Output is correct
37 Correct 1680 ms 20192 KB Output is correct
38 Correct 1266 ms 20204 KB Output is correct
39 Correct 561 ms 24104 KB Output is correct
40 Correct 422 ms 30296 KB Output is correct
41 Correct 404 ms 38176 KB Output is correct
42 Correct 338 ms 39344 KB Output is correct
43 Correct 357 ms 47240 KB Output is correct
44 Correct 373 ms 51760 KB Output is correct
45 Correct 332 ms 53220 KB Output is correct
46 Correct 761 ms 23696 KB Output is correct
47 Correct 1014 ms 23260 KB Output is correct
48 Correct 2090 ms 23176 KB Output is correct
49 Correct 1699 ms 22040 KB Output is correct
50 Correct 301 ms 31492 KB Output is correct
51 Correct 281 ms 30768 KB Output is correct
52 Correct 285 ms 30656 KB Output is correct
53 Correct 327 ms 31140 KB Output is correct
54 Correct 311 ms 31112 KB Output is correct
55 Correct 2 ms 3020 KB Output is correct