oj.uz

Submission #854303

# Submission time Handle Problem Language Result Execution time Memory
854303 2023-09-26T17:00:40 Z Lobo Swap Swap Sort (CCO21_day1problem1) C++17
25 / 25
 653 ms 302544 KB 
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3","unroll-loops")
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
// #define int long long
#define lol long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
const int maxn = 1e5+10;
const int B = 70;

int n, k, q, a[maxn], id[maxn], cntid, tr[4*maxn];
vector<int> fq[maxn];
vector<vector<int>> inv;

void upd(int no, int l, int r, int pos, int val) {
    if(l > pos || r < pos) return;
    if(l == r) {
        tr[no]+= val;
        return;
    }
    int lc=2*no,rc=2*no+1,mid=(l+r)>>1;
    upd(lc,l,mid,pos,val);
    upd(rc,mid+1,r,pos,val);
    tr[no] = tr[lc]+tr[rc];
}

int qry(int no, int l, int r, int ll, int rr) {
    if(l > rr || r < ll) return 0;
    if(l >= ll && r <= rr) return tr[no];
    int lc=2*no,rc=2*no+1,mid=(l+r)>>1;
    return qry(lc,l,mid,ll,rr)+qry(rc,mid+1,r,ll,rr);
}

void solve() {
    cin >> n >> k >> q;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        fq[a[i]].pb(i);
    }


    for(int x = 1; x <= k; x++) {
        if(fq[x].size() >= B) {
            id[x] = cntid++;
            inv.pb(vector<int>(k+1,0));

            int cntafter = fq[x].size();
            for(int i = 1; i <= n; i++) {
                if(a[i] == x) cntafter--;
                else {
                    inv[id[x]][a[i]]+= cntafter;
                }
            }
        }
    }

    lol invcur = 0;
    for(int i = 1; i <= n; i++) {
        invcur+= qry(1,1,k,a[i]+1,k);
        upd(1,1,k,a[i],1);
    }

    vector<int> p(k+1); for(int i = 1; i <= k; i++) p[i] = i;

    for(int i = 1; i <= q; i++) {
        int j; cin >> j;
        int l = p[j];
        int r = p[j+1];

        lol lr,rl;

        if(fq[l].size() >= B) {
            lr = inv[id[l]][r];
            rl = fq[l].size()*fq[r].size() - lr;
        }
        else if(fq[r].size() >= B) {
            rl = inv[id[r]][l];
            lr = fq[l].size()*fq[r].size() - rl;
        }
        else {
            int cntr = 0;
            lr = 0;
            int pl = 0;
            int pr = 0;
            while(pl != fq[l].size() || pr != fq[r].size()) {
                if(pr == fq[r].size() || (pl != fq[l].size() && fq[l][pl] < fq[r][pr])) {
                    lr+= cntr;
                    pl++;
                }
                else {
                    cntr++;
                    pr++;
                }
            }
            rl = fq[l].size()*fq[r].size() - lr;
        }

        invcur+= -lr+rl;
        swap(p[j],p[j+1]);
        cout << invcur << endl;
    }

}
    
int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);
    int tt = 1;
    // cin >> tt;
    while(tt--) {
        solve();
    }

}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:92:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             while(pl != fq[l].size() || pr != fq[r].size()) {
      |                   ~~~^~~~~~~~~~~~~~~
Main.cpp:92:44: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |             while(pl != fq[l].size() || pr != fq[r].size()) {
      |                                         ~~~^~~~~~~~~~~~~~~
Main.cpp:93:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |                 if(pr == fq[r].size() || (pl != fq[l].size() && fq[l][pl] < fq[r][pr])) {
      |                    ~~~^~~~~~~~~~~~~~~
Main.cpp:93:46: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |                 if(pr == fq[r].size() || (pl != fq[l].size() && fq[l][pl] < fq[r][pr])) {
      |                                           ~~~^~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4696 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 7 ms 4700 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 3 ms 4696 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5524 KB Output is correct
2 Correct 8 ms 5724 KB Output is correct
3 Correct 26 ms 5976 KB Output is correct
4 Correct 159 ms 9652 KB Output is correct
5 Correct 25 ms 5876 KB Output is correct
6 Correct 34 ms 5976 KB Output is correct
7 Correct 32 ms 6516 KB Output is correct
8 Correct 37 ms 7248 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 16868 KB Output is correct
2 Correct 115 ms 16644 KB Output is correct
3 Correct 127 ms 16464 KB Output is correct
4 Correct 139 ms 16976 KB Output is correct
5 Correct 184 ms 17488 KB Output is correct
6 Correct 199 ms 17744 KB Output is correct
7 Correct 206 ms 17744 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4696 KB Output is correct
2 Correct 2 ms 4696 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 7 ms 4700 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 3 ms 4696 KB Output is correct
9 Correct 8 ms 5524 KB Output is correct
10 Correct 8 ms 5724 KB Output is correct
11 Correct 26 ms 5976 KB Output is correct
12 Correct 159 ms 9652 KB Output is correct
13 Correct 25 ms 5876 KB Output is correct
14 Correct 34 ms 5976 KB Output is correct
15 Correct 32 ms 6516 KB Output is correct
16 Correct 37 ms 7248 KB Output is correct
17 Correct 126 ms 16868 KB Output is correct
18 Correct 115 ms 16644 KB Output is correct
19 Correct 127 ms 16464 KB Output is correct
20 Correct 139 ms 16976 KB Output is correct
21 Correct 184 ms 17488 KB Output is correct
22 Correct 199 ms 17744 KB Output is correct
23 Correct 206 ms 17744 KB Output is correct
24 Correct 278 ms 20560 KB Output is correct
25 Correct 653 ms 16624 KB Output is correct
26 Correct 370 ms 16720 KB Output is correct
27 Correct 281 ms 16976 KB Output is correct
28 Correct 247 ms 17020 KB Output is correct
29 Correct 235 ms 17652 KB Output is correct
30 Correct 205 ms 18512 KB Output is correct
31 Correct 206 ms 18524 KB Output is correct
32 Correct 158 ms 22608 KB Output is correct
33 Correct 185 ms 17232 KB Output is correct
34 Correct 229 ms 17736 KB Output is correct
35 Correct 214 ms 18256 KB Output is correct
36 Correct 277 ms 20560 KB Output is correct
37 Correct 529 ms 19028 KB Output is correct
38 Correct 529 ms 16720 KB Output is correct
39 Correct 203 ms 18512 KB Output is correct
40 Correct 209 ms 21388 KB Output is correct
41 Correct 197 ms 25424 KB Output is correct
42 Correct 180 ms 25944 KB Output is correct
43 Correct 172 ms 29776 KB Output is correct
44 Correct 179 ms 32788 KB Output is correct
45 Correct 177 ms 33616 KB Output is correct
46 Correct 321 ms 18064 KB Output is correct
47 Correct 438 ms 20316 KB Output is correct
48 Correct 539 ms 302544 KB Output is correct
49 Correct 612 ms 75228 KB Output is correct
50 Correct 165 ms 21840 KB Output is correct
51 Correct 177 ms 21296 KB Output is correct
52 Correct 152 ms 21124 KB Output is correct
53 Correct 171 ms 22096 KB Output is correct
54 Correct 171 ms 22096 KB Output is correct
55 Correct 1 ms 4700 KB Output is correct