oj.uz

Submission #635762

# Submission time Handle Problem Language Result Execution time Memory
635762 2022-08-26T19:12:58 Z jhnah917 Swap Swap Sort (CCO21_day1problem1) C++14
25 / 25
 2582 ms 85820 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int N, K, Q, A[101010], B[101010], T[101010];
vector<int> P[101010]; ll R;
void Add(int x, int v){ for(x+=3; x<101010; x+=x&-x) T[x] += v; }
int Get(int x){ int ret = 0; for(x+=3; x; x-=x&-x) ret += T[x]; return ret; }

map<pair<int,int>, ll> Cache;
ll Swap(int u, int v){
    auto it = Cache.lower_bound(make_pair(u, v));
    if(it != Cache.end() && it->first == make_pair(u, v)) return it->second;

    ll res = 0;
    if(P[u].size() < P[v].size()){
        for(auto i : P[u]){
            int cnt = P[v].end() - lower_bound(P[v].begin(), P[v].end(), i);
            res += cnt - ((int)P[v].size() - cnt);
        }
    }
    else{
        for(auto i : P[v]){
            int cnt = lower_bound(P[u].begin(), P[u].end(), i) - P[u].begin();
            res += cnt - ((int)P[u].size() - cnt);
        }
    }
    Cache.emplace_hint(it, make_pair(u, v), res);
    return res;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N >> K >> Q; iota(B+1, B+K+1, 1);
    for(int i=1; i<=N; i++) cin >> A[i], P[A[i]].push_back(i);
    for(int i=N; i>=1; i--) R += Get(A[i]-1), Add(A[i], 1);
    for(int q=1; q<=Q; q++){
        int t; cin >> t;
        R += Swap(B[t], B[t+1]); swap(B[t], B[t+1]);
        cout << R << "\n";
    }
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 4 ms 2844 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 7 ms 2796 KB Output is correct
5 Correct 5 ms 2900 KB Output is correct
6 Correct 5 ms 3028 KB Output is correct
7 Correct 4 ms 3028 KB Output is correct
8 Correct 5 ms 3228 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 3856 KB Output is correct
2 Correct 18 ms 3924 KB Output is correct
3 Correct 13 ms 3992 KB Output is correct
4 Correct 13 ms 3988 KB Output is correct
5 Correct 14 ms 4308 KB Output is correct
6 Correct 15 ms 4516 KB Output is correct
7 Correct 20 ms 5368 KB Output is correct
8 Correct 25 ms 6352 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 16920 KB Output is correct
2 Correct 161 ms 16932 KB Output is correct
3 Correct 294 ms 17424 KB Output is correct
4 Correct 589 ms 18336 KB Output is correct
5 Correct 742 ms 22220 KB Output is correct
6 Correct 754 ms 22720 KB Output is correct
7 Correct 744 ms 22608 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 4 ms 2844 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 7 ms 2796 KB Output is correct
5 Correct 5 ms 2900 KB Output is correct
6 Correct 5 ms 3028 KB Output is correct
7 Correct 4 ms 3028 KB Output is correct
8 Correct 5 ms 3228 KB Output is correct
9 Correct 15 ms 3856 KB Output is correct
10 Correct 18 ms 3924 KB Output is correct
11 Correct 13 ms 3992 KB Output is correct
12 Correct 13 ms 3988 KB Output is correct
13 Correct 14 ms 4308 KB Output is correct
14 Correct 15 ms 4516 KB Output is correct
15 Correct 20 ms 5368 KB Output is correct
16 Correct 25 ms 6352 KB Output is correct
17 Correct 157 ms 16920 KB Output is correct
18 Correct 161 ms 16932 KB Output is correct
19 Correct 294 ms 17424 KB Output is correct
20 Correct 589 ms 18336 KB Output is correct
21 Correct 742 ms 22220 KB Output is correct
22 Correct 754 ms 22720 KB Output is correct
23 Correct 744 ms 22608 KB Output is correct
24 Correct 709 ms 24848 KB Output is correct
25 Correct 667 ms 27632 KB Output is correct
26 Correct 789 ms 32608 KB Output is correct
27 Correct 826 ms 37560 KB Output is correct
28 Correct 929 ms 43692 KB Output is correct
29 Correct 1102 ms 54052 KB Output is correct
30 Correct 1209 ms 62720 KB Output is correct
31 Correct 1151 ms 62616 KB Output is correct
32 Correct 582 ms 85608 KB Output is correct
33 Correct 931 ms 23736 KB Output is correct
34 Correct 1063 ms 25480 KB Output is correct
35 Correct 1157 ms 27612 KB Output is correct
36 Correct 1604 ms 37952 KB Output is correct
37 Correct 2421 ms 81844 KB Output is correct
38 Correct 2236 ms 82592 KB Output is correct
39 Correct 1301 ms 85820 KB Output is correct
40 Correct 1046 ms 71976 KB Output is correct
41 Correct 1030 ms 76060 KB Output is correct
42 Correct 821 ms 85288 KB Output is correct
43 Correct 844 ms 85228 KB Output is correct
44 Correct 1002 ms 85524 KB Output is correct
45 Correct 877 ms 85404 KB Output is correct
46 Correct 1235 ms 72488 KB Output is correct
47 Correct 1418 ms 76964 KB Output is correct
48 Correct 2582 ms 84616 KB Output is correct
49 Correct 2364 ms 84268 KB Output is correct
50 Correct 657 ms 85400 KB Output is correct
51 Correct 593 ms 84340 KB Output is correct
52 Correct 584 ms 84316 KB Output is correct
53 Correct 752 ms 85176 KB Output is correct
54 Correct 749 ms 85108 KB Output is correct
55 Correct 2 ms 2644 KB Output is correct