oj.uz

Submission #854298

# Submission time Handle Problem Language Result Execution time Memory
854298 2023-09-26T16:55:59 Z Lobo Swap Swap Sort (CCO21_day1problem1) C++17
25 / 25
 741 ms 994904 KB 
#include<bits/stdc++.h>
using namespace std;
const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int 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 = 60;
 
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;
                }
            }
        }
    }
 
    int 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];
 
        int 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:90:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             while(pl != fq[l].size() || pr != fq[r].size()) {
      |                   ~~~^~~~~~~~~~~~~~~
Main.cpp:90:44: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |             while(pl != fq[l].size() || pr != fq[r].size()) {
      |                                         ~~~^~~~~~~~~~~~~~~
Main.cpp:91:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |                 if(pr == fq[r].size() || (pl != fq[l].size() && fq[l][pl] < fq[r][pr])) {
      |                    ~~~^~~~~~~~~~~~~~~
Main.cpp:91:46: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |                 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 1 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 2 ms 6744 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 5 ms 6748 KB Output is correct
6 Correct 6 ms 6748 KB Output is correct
7 Correct 3 ms 6756 KB Output is correct
8 Correct 3 ms 6744 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 8652 KB Output is correct
2 Correct 9 ms 8660 KB Output is correct
3 Correct 28 ms 8644 KB Output is correct
4 Correct 147 ms 16568 KB Output is correct
5 Correct 36 ms 8864 KB Output is correct
6 Correct 31 ms 8808 KB Output is correct
7 Correct 49 ms 9596 KB Output is correct
8 Correct 46 ms 10368 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 19468 KB Output is correct
2 Correct 130 ms 19360 KB Output is correct
3 Correct 158 ms 19572 KB Output is correct
4 Correct 173 ms 19552 KB Output is correct
5 Correct 209 ms 20896 KB Output is correct
6 Correct 228 ms 21652 KB Output is correct
7 Correct 226 ms 21588 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 3 ms 6748 KB Output is correct
3 Correct 2 ms 6744 KB Output is correct
4 Correct 2 ms 6748 KB Output is correct
5 Correct 5 ms 6748 KB Output is correct
6 Correct 6 ms 6748 KB Output is correct
7 Correct 3 ms 6756 KB Output is correct
8 Correct 3 ms 6744 KB Output is correct
9 Correct 8 ms 8652 KB Output is correct
10 Correct 9 ms 8660 KB Output is correct
11 Correct 28 ms 8644 KB Output is correct
12 Correct 147 ms 16568 KB Output is correct
13 Correct 36 ms 8864 KB Output is correct
14 Correct 31 ms 8808 KB Output is correct
15 Correct 49 ms 9596 KB Output is correct
16 Correct 46 ms 10368 KB Output is correct
17 Correct 131 ms 19468 KB Output is correct
18 Correct 130 ms 19360 KB Output is correct
19 Correct 158 ms 19572 KB Output is correct
20 Correct 173 ms 19552 KB Output is correct
21 Correct 209 ms 20896 KB Output is correct
22 Correct 228 ms 21652 KB Output is correct
23 Correct 226 ms 21588 KB Output is correct
24 Correct 290 ms 27560 KB Output is correct
25 Correct 638 ms 22260 KB Output is correct
26 Correct 402 ms 19916 KB Output is correct
27 Correct 306 ms 19792 KB Output is correct
28 Correct 284 ms 20104 KB Output is correct
29 Correct 261 ms 20488 KB Output is correct
30 Correct 230 ms 21296 KB Output is correct
31 Correct 238 ms 21332 KB Output is correct
32 Correct 178 ms 30140 KB Output is correct
33 Correct 198 ms 21040 KB Output is correct
34 Correct 232 ms 21644 KB Output is correct
35 Correct 219 ms 22556 KB Output is correct
36 Correct 292 ms 27476 KB Output is correct
37 Correct 470 ms 28104 KB Output is correct
38 Correct 531 ms 21172 KB Output is correct
39 Correct 235 ms 21428 KB Output is correct
40 Correct 213 ms 27568 KB Output is correct
41 Correct 226 ms 35460 KB Output is correct
42 Correct 197 ms 36680 KB Output is correct
43 Correct 203 ms 44608 KB Output is correct
44 Correct 211 ms 50768 KB Output is correct
45 Correct 223 ms 52412 KB Output is correct
46 Correct 355 ms 22704 KB Output is correct
47 Correct 463 ms 98864 KB Output is correct
48 Correct 741 ms 994904 KB Output is correct
49 Correct 627 ms 319260 KB Output is correct
50 Correct 180 ms 28916 KB Output is correct
51 Correct 172 ms 28560 KB Output is correct
52 Correct 174 ms 28716 KB Output is correct
53 Correct 182 ms 28788 KB Output is correct
54 Correct 187 ms 28684 KB Output is correct
55 Correct 1 ms 6748 KB Output is correct