oj.uz

Submission #411668

# Submission time Handle Problem Language Result Execution time Memory
411668 2021-05-25T17:30:26 Z Plasmatic Swap Swap Sort (CCO21_day1problem1) C++17
25 / 25
 4306 ms 79376 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 0x3f3f3f3f, LLINF = 0x3f3f3f3f3f3f3f3f;
using pii = pair<int, int>;

const int MN = 1e5 + 1;
int N, K, Q,
    A[MN], P[MN];

int bit[MN];
void add(int x, int v) {
    for (; x < MN; x += x & -x)
        bit[x] += v;
}
int query(int x) {
    int sum = 0;
    for (; x; x -= x & -x)
        sum += bit[x];
    return sum;
}

vector<int> idx[MN];
map<pii, ll> sto; // num of pairs (i,j) s.t. a.first after a.second

ll C2(ll k) { return k*(k-1)/2; }
ll tot(ll f1, ll f2) { return C2(f1+f2) - C2(f1) - C2(f2); }
ll get(int a, int b) {
    ll ctot = tot(idx[a].size(), idx[b].size());
    if (sto.count({a, b})) return sto[{a, b}];
    else if (sto.count({b, a})) return ctot-sto[{b, a}];

    ll res = 0;
    if (idx[a].size() < idx[b].size()) {
        auto &v = idx[b];
        for (auto x : idx[a]) {
            res += lower_bound(v.begin(), v.end(), x)-v.begin();
        }
    }
    else {
        auto &v = idx[a];
        for (auto x : idx[b]) {
            res += v.end() - upper_bound(v.begin(), v.end(), x);
        }
    }

    return sto[{a, b}] = res;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> N >> K >> Q;
    ll invc = 0;
    for (auto i = 1; i <= N; i++) {
        cin >> A[i];
        invc += query(K) - query(A[i]);
        add(A[i], 1);

        idx[A[i]].push_back(i);
    }
    iota(P+1, P+N+1, 1);

    while (Q--) {
        int x; cin >> x;

        ll ch = tot(idx[P[x]].size(), idx[P[x+1]].size()) - 2*get(P[x], P[x+1]);
        invc += ch;
        cout << invc << '\n';

        swap(P[x], P[x+1]);
    }

    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 4 ms 2764 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 7 ms 2764 KB Output is correct
5 Correct 6 ms 2764 KB Output is correct
6 Correct 6 ms 2892 KB Output is correct
7 Correct 6 ms 2892 KB Output is correct
8 Correct 6 ms 3020 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3976 KB Output is correct
2 Correct 23 ms 3980 KB Output is correct
3 Correct 22 ms 3996 KB Output is correct
4 Correct 18 ms 3972 KB Output is correct
5 Correct 19 ms 4244 KB Output is correct
6 Correct 21 ms 4300 KB Output is correct
7 Correct 25 ms 4920 KB Output is correct
8 Correct 46 ms 5804 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 246 ms 15072 KB Output is correct
2 Correct 258 ms 15192 KB Output is correct
3 Correct 399 ms 14948 KB Output is correct
4 Correct 662 ms 15340 KB Output is correct
5 Correct 933 ms 16748 KB Output is correct
6 Correct 943 ms 17072 KB Output is correct
7 Correct 955 ms 17116 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2636 KB Output is correct
2 Correct 4 ms 2764 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 7 ms 2764 KB Output is correct
5 Correct 6 ms 2764 KB Output is correct
6 Correct 6 ms 2892 KB Output is correct
7 Correct 6 ms 2892 KB Output is correct
8 Correct 6 ms 3020 KB Output is correct
9 Correct 19 ms 3976 KB Output is correct
10 Correct 23 ms 3980 KB Output is correct
11 Correct 22 ms 3996 KB Output is correct
12 Correct 18 ms 3972 KB Output is correct
13 Correct 19 ms 4244 KB Output is correct
14 Correct 21 ms 4300 KB Output is correct
15 Correct 25 ms 4920 KB Output is correct
16 Correct 46 ms 5804 KB Output is correct
17 Correct 246 ms 15072 KB Output is correct
18 Correct 258 ms 15192 KB Output is correct
19 Correct 399 ms 14948 KB Output is correct
20 Correct 662 ms 15340 KB Output is correct
21 Correct 933 ms 16748 KB Output is correct
22 Correct 943 ms 17072 KB Output is correct
23 Correct 955 ms 17116 KB Output is correct
24 Correct 900 ms 18044 KB Output is correct
25 Correct 917 ms 19264 KB Output is correct
26 Correct 1060 ms 21768 KB Output is correct
27 Correct 1283 ms 24368 KB Output is correct
28 Correct 1390 ms 27844 KB Output is correct
29 Correct 1502 ms 34328 KB Output is correct
30 Correct 1676 ms 40660 KB Output is correct
31 Correct 1674 ms 40600 KB Output is correct
32 Correct 1069 ms 79376 KB Output is correct
33 Correct 1235 ms 18324 KB Output is correct
34 Correct 1369 ms 19892 KB Output is correct
35 Correct 1567 ms 21692 KB Output is correct
36 Correct 2187 ms 31712 KB Output is correct
37 Correct 3886 ms 77000 KB Output is correct
38 Correct 3467 ms 77772 KB Output is correct
39 Correct 2592 ms 79376 KB Output is correct
40 Correct 1720 ms 54096 KB Output is correct
41 Correct 1724 ms 60212 KB Output is correct
42 Correct 1511 ms 78672 KB Output is correct
43 Correct 1486 ms 78200 KB Output is correct
44 Correct 1776 ms 78920 KB Output is correct
45 Correct 1598 ms 78948 KB Output is correct
46 Correct 1905 ms 55244 KB Output is correct
47 Correct 2339 ms 62628 KB Output is correct
48 Correct 4306 ms 78008 KB Output is correct
49 Correct 3824 ms 77816 KB Output is correct
50 Correct 1085 ms 79084 KB Output is correct
51 Correct 1002 ms 78108 KB Output is correct
52 Correct 1006 ms 78144 KB Output is correct
53 Correct 1209 ms 79268 KB Output is correct
54 Correct 1240 ms 79236 KB Output is correct
55 Correct 2 ms 2636 KB Output is correct