oj.uz

Submission #852552

# Submission time Handle Problem Language Result Execution time Memory
852552 2023-09-22T05:00:39 Z LucaDantas Swap Swap Sort (CCO21_day1problem1) C++17
25 / 25
 1630 ms 471540 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long

constexpr int B = 100, maxn = 1e5+10;

vector<int> pos[maxn];

int a[maxn], id[maxn], cnt;

long long resp[maxn/B+10][maxn];

struct BIT {
    int bit[maxn];
    void upd(int x) {
        for(; x > 0; x-=x&-x)
            ++bit[x];
    }
    int query(int x) {
        int ans = 0;
        for(; x < maxn; x+=x&-x)
            ans += bit[x];
        return ans;
    }
} bit;

long long inversoes(int n) {
    long long ans = 0;
    for(int i = 1; i <= n; i++) {
        ans += bit.query(a[i]+1);
        bit.upd(a[i]);
    }
    return ans;
}

int32_t main() {
    int n, k, q; scanf("%lld %lld %lld", &n, &k, &q);
    for(int i = 1; i <= n; i++)
        scanf("%lld", a+i), pos[a[i]].push_back(i);
    for(int cor = 1; cor <= k; cor++) {
        if(pos[cor].size() >= B) {
            id[cor] = ++cnt;
            int qtd = 0;
            for(int i = n; i >= 1; i--) {
                if(a[i] == cor)
                    ++qtd;
                else
                    resp[cnt][a[i]] += qtd;
            }
        }
    }
    long long ans = inversoes(n);
    vector<int> perm(k);
    iota(perm.begin(), perm.end(), 1);
    while(q--) {
        auto get = [&](int x, int y) -> long long {
            if(pos[x].size() >= B)
                return resp[id[x]][y];
            if(pos[y].size() >= B)
                return 1ll * pos[x].size() * pos[y].size() - resp[id[y]][x];
            long long aq = 0;
            for(int i = 0, ptr = 0; i < (int)(pos[y].size()); i++) {
                for(; ptr < (int)(pos[x].size()) && pos[x][ptr] < pos[y][i]; ptr++);
                aq += pos[x].size() - ptr;
            }
            return aq;
        };
        int index; scanf("%lld", &index); --index;
        ans -= get(perm[index], perm[index+1]);
        swap(perm[index], perm[index+1]);
        ans += get(perm[index], perm[index+1]);
        printf("%lld\n", ans);
    }
}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:38:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |     int n, k, q; scanf("%lld %lld %lld", &n, &k, &q);
      |                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         scanf("%lld", a+i), pos[a[i]].push_back(i);
      |         ~~~~~^~~~~~~~~~~~~
Main.cpp:69:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |         int index; scanf("%lld", &index); --index;
      |                    ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5468 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Correct 5 ms 26204 KB Output is correct
5 Correct 9 ms 5724 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 3 ms 5724 KB Output is correct
8 Correct 3 ms 5720 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 10556 KB Output is correct
2 Correct 10 ms 10444 KB Output is correct
3 Correct 26 ms 86648 KB Output is correct
4 Correct 83 ms 406864 KB Output is correct
5 Correct 14 ms 7000 KB Output is correct
6 Correct 15 ms 7004 KB Output is correct
7 Correct 18 ms 7924 KB Output is correct
8 Correct 21 ms 9180 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 21472 KB Output is correct
2 Correct 183 ms 21900 KB Output is correct
3 Correct 192 ms 37972 KB Output is correct
4 Correct 202 ms 97752 KB Output is correct
5 Correct 243 ms 331908 KB Output is correct
6 Correct 258 ms 411732 KB Output is correct
7 Correct 261 ms 412116 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 5468 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9820 KB Output is correct
4 Correct 5 ms 26204 KB Output is correct
5 Correct 9 ms 5724 KB Output is correct
6 Correct 4 ms 5724 KB Output is correct
7 Correct 3 ms 5724 KB Output is correct
8 Correct 3 ms 5720 KB Output is correct
9 Correct 10 ms 10556 KB Output is correct
10 Correct 10 ms 10444 KB Output is correct
11 Correct 26 ms 86648 KB Output is correct
12 Correct 83 ms 406864 KB Output is correct
13 Correct 14 ms 7000 KB Output is correct
14 Correct 15 ms 7004 KB Output is correct
15 Correct 18 ms 7924 KB Output is correct
16 Correct 21 ms 9180 KB Output is correct
17 Correct 184 ms 21472 KB Output is correct
18 Correct 183 ms 21900 KB Output is correct
19 Correct 192 ms 37972 KB Output is correct
20 Correct 202 ms 97752 KB Output is correct
21 Correct 243 ms 331908 KB Output is correct
22 Correct 258 ms 411732 KB Output is correct
23 Correct 261 ms 412116 KB Output is correct
24 Correct 710 ms 430512 KB Output is correct
25 Correct 1249 ms 22940 KB Output is correct
26 Correct 642 ms 23388 KB Output is correct
27 Correct 455 ms 23636 KB Output is correct
28 Correct 356 ms 24116 KB Output is correct
29 Correct 284 ms 25252 KB Output is correct
30 Correct 270 ms 26448 KB Output is correct
31 Correct 264 ms 26492 KB Output is correct
32 Correct 207 ms 36180 KB Output is correct
33 Correct 250 ms 335792 KB Output is correct
34 Correct 266 ms 415824 KB Output is correct
35 Correct 349 ms 471540 KB Output is correct
36 Correct 724 ms 407600 KB Output is correct
37 Correct 1284 ms 32872 KB Output is correct
38 Correct 948 ms 23092 KB Output is correct
39 Correct 270 ms 26452 KB Output is correct
40 Correct 263 ms 34128 KB Output is correct
41 Correct 251 ms 42356 KB Output is correct
42 Correct 237 ms 44372 KB Output is correct
43 Correct 235 ms 52308 KB Output is correct
44 Correct 237 ms 58452 KB Output is correct
45 Correct 235 ms 58448 KB Output is correct
46 Correct 519 ms 26164 KB Output is correct
47 Correct 751 ms 25792 KB Output is correct
48 Correct 1630 ms 26056 KB Output is correct
49 Correct 1266 ms 24988 KB Output is correct
50 Correct 234 ms 35668 KB Output is correct
51 Correct 209 ms 35408 KB Output is correct
52 Correct 212 ms 35592 KB Output is correct
53 Correct 230 ms 43860 KB Output is correct
54 Correct 219 ms 43756 KB Output is correct
55 Correct 1 ms 5468 KB Output is correct