oj.uz

Submission #696363

# Submission time Handle Problem Language Result Execution time Memory
696363 2023-02-06T10:29:33 Z Cross_Ratio Swap Swap Sort (CCO21_day1problem1) C++14
25 / 25
 3774 ms 55180 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
int A[100005];
int B[100005];
int C[100005];
vector<int> D[100005];
struct SegTree {
    vector<int> seg;
    int MAX;
    SegTree(int N) {
        int i;
        for(i=1;i<2*N;i*=2) {}
        seg.resize(i);
        MAX = i;
    }
    void Edit(int n, int a) {
        n += MAX/2;
        seg[n] += a;
        n /= 2;
        while(n) {
            seg[n] = seg[2*n] + seg[2*n+1];
            n /= 2;
        }
    }
    int sum(int s, int e, int n, int ns, int ne) {
        if(e<=ns||ne<=s) return 0;
        if(s<=ns&&ne<=e) return seg[n];
        int mid = ns + ne >> 1;
        return sum(s, e, 2*n, ns, mid) + sum(s, e, 2*n+1, mid, ne);
    }
};
int id[100005];
int sB = 200;
int E[500][100005];
int calc(int x, int y) {
    if(id[x]!=-1) return E[id[x]][y];
    if(id[y]!=-1) return B[x] * B[y] - E[id[y]][x];
    int sum = 0;
    for(int n : D[y]) {
        sum += lower_bound(D[x].begin(),D[x].end(),n) - D[x].begin();
    }
    return sum;
}
signed main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int N, K, Q;
    cin >> N >> K >> Q;
    int i, j;
    for(i=0;i<N;i++) {
        cin >> A[i];
        B[A[i]]++;
        D[A[i]].push_back(i);
    }
    for(i=1;i<=K;i++) C[i] = i;
    int ans = 0;
    SegTree tree(K+1);
    int MAX = tree.MAX;
    for(i=0;i<N;i++) {
        ans += tree.sum(A[i]+1, K+1, 1, 0, MAX/2);
        tree.Edit(A[i], 1);
    }
    int id_cnt = 0;
    for(i=1;i<=K;i++) id[i] = -1;
    for(i=1;i<=K;i++) {
        if(B[i] >= sB) {
            id[i] = id_cnt;
            int v = 0;
            for(j=0;j<N;j++) {
                if(A[j]==i) v++;
                E[id_cnt][A[j]] += v;
            }
            id_cnt++;
        }
    }
    while(Q--) {
        int k;
        cin >> k;
        int v1 = C[k], v2 = C[k+1];
        int val = calc(v2, v1);
        ans += B[v1] * B[v2] - 2*val;
        C[k] = v2, C[k+1] = v1;
        cout << ans << '\n';
    }
}

Compilation message

Main.cpp: In member function 'long long int SegTree::sum(long long int, long long int, long long int, long long int, long long int)':
Main.cpp:29:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   29 |         int mid = ns + ne >> 1;
      |                   ~~~^~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 4520 KB Output is correct
2 Correct 9 ms 4560 KB Output is correct
3 Correct 44 ms 5200 KB Output is correct
4 Correct 22 ms 4564 KB Output is correct
5 Correct 30 ms 5060 KB Output is correct
6 Correct 33 ms 5324 KB Output is correct
7 Correct 39 ms 7372 KB Output is correct
8 Correct 47 ms 9932 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 15368 KB Output is correct
2 Correct 139 ms 15448 KB Output is correct
3 Correct 167 ms 15508 KB Output is correct
4 Correct 183 ms 16172 KB Output is correct
5 Correct 265 ms 19732 KB Output is correct
6 Correct 1371 ms 22156 KB Output is correct
7 Correct 1190 ms 22156 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2900 KB Output is correct
3 Correct 3 ms 2772 KB Output is correct
4 Correct 6 ms 2908 KB Output is correct
5 Correct 7 ms 2772 KB Output is correct
6 Correct 4 ms 2900 KB Output is correct
7 Correct 4 ms 2900 KB Output is correct
8 Correct 4 ms 3120 KB Output is correct
9 Correct 10 ms 4520 KB Output is correct
10 Correct 9 ms 4560 KB Output is correct
11 Correct 44 ms 5200 KB Output is correct
12 Correct 22 ms 4564 KB Output is correct
13 Correct 30 ms 5060 KB Output is correct
14 Correct 33 ms 5324 KB Output is correct
15 Correct 39 ms 7372 KB Output is correct
16 Correct 47 ms 9932 KB Output is correct
17 Correct 141 ms 15368 KB Output is correct
18 Correct 139 ms 15448 KB Output is correct
19 Correct 167 ms 15508 KB Output is correct
20 Correct 183 ms 16172 KB Output is correct
21 Correct 265 ms 19732 KB Output is correct
22 Correct 1371 ms 22156 KB Output is correct
23 Correct 1190 ms 22156 KB Output is correct
24 Correct 2132 ms 19856 KB Output is correct
25 Correct 998 ms 20600 KB Output is correct
26 Correct 498 ms 21216 KB Output is correct
27 Correct 343 ms 21672 KB Output is correct
28 Correct 296 ms 22904 KB Output is correct
29 Correct 299 ms 24760 KB Output is correct
30 Correct 348 ms 27340 KB Output is correct
31 Correct 343 ms 27372 KB Output is correct
32 Correct 201 ms 36004 KB Output is correct
33 Correct 274 ms 23300 KB Output is correct
34 Correct 1189 ms 22416 KB Output is correct
35 Correct 3774 ms 20084 KB Output is correct
36 Correct 2177 ms 20048 KB Output is correct
37 Correct 1174 ms 20844 KB Output is correct
38 Correct 781 ms 20984 KB Output is correct
39 Correct 315 ms 27296 KB Output is correct
40 Correct 322 ms 33504 KB Output is correct
41 Correct 298 ms 39724 KB Output is correct
42 Correct 244 ms 42700 KB Output is correct
43 Correct 236 ms 48996 KB Output is correct
44 Correct 240 ms 55180 KB Output is correct
45 Correct 248 ms 54376 KB Output is correct
46 Correct 470 ms 26900 KB Output is correct
47 Correct 653 ms 26452 KB Output is correct
48 Correct 1450 ms 26832 KB Output is correct
49 Correct 1103 ms 25860 KB Output is correct
50 Correct 264 ms 34760 KB Output is correct
51 Correct 205 ms 34392 KB Output is correct
52 Correct 221 ms 34228 KB Output is correct
53 Correct 218 ms 32772 KB Output is correct
54 Correct 245 ms 32852 KB Output is correct
55 Correct 2 ms 2644 KB Output is correct