oj.uz

Submission #1097551

# Submission time Handle Problem Language Result Execution time Memory
1097551 2024-10-07T14:49:26 Z alexander707070 Diversity (CEOI21_diversity) C++14
38 / 100
 106 ms 51028 KB 
#include<bits/stdc++.h>

#define MAXN 300007
using namespace std;

const int bucket_sz=500;

int n,a[MAXN],q;

int br[MAXN],maxs,l,r,p[MAXN],len,bucket[MAXN],pos[MAXN],nxt[MAXN][20],pr[MAXN][20],w[MAXN];
long long ans,mult,sum,s[MAXN],res[MAXN];

struct Fenwick{
    long long fenwick[MAXN];

    void update(int x,long long val){
        while(x<=maxs){
            fenwick[x]+=val;
            x+=(x & (-x));
        }
    }

    long long getsum(int x){
        long long res=0;
        
        while(x>=1){
            res+=fenwick[x];
            x^=(x & (-x));
        }

        return res;
    }
}pref,suff,sumpref,sumsuff;

struct query{
    int l,r,id;

    inline friend bool operator < (query fr,query sc){
        if(bucket[fr.l]!=bucket[sc.l])return bucket[fr.l]<bucket[sc.l];
        return fr.r<sc.r;
    }

}qs[MAXN];

long long calc(int x){
    return pref.getsum(x-1)-sumpref.getsum(x-1)*(maxs-x+1) + suff.getsum(maxs-x)-sumsuff.getsum(maxs-x)*x; 
}

void change(int x,long long val){
    if(val==0)return;

    long long mul=calc(x);

    ans-=s[x]*mul;
    ans-=s[x]*(s[x]-1)/2+s[x];

    s[x]+=val;

    sumpref.update(x,val);
    sumsuff.update(maxs-x+1,val);

    pref.update(x,(maxs-x+2)*val);
    suff.update(maxs-x+1,(x+1)*val);

    ans+=s[x]*mul;
    ans+=s[x]*(s[x]-1)/2+s[x];
}

void calcdp(){
    for(int j=1;j<20;j++){
        for(int i=1;i<=n;i++){
            nxt[i][j]=nxt[nxt[i][j-1]][j-1];
            pr[i][j]=pr[pr[i][j-1]][j-1];
        }
    }
}

void add(int x){
    br[x]++;

    int z=pos[x];
    for(int s=10;s>=0;s--){
        if(br[w[nxt[z][s]]]<br[x])z=nxt[z][s];
    }

    int y=w[z];

    if(x!=y){
        change(pos[x],br[y]-(br[x]-1));
        change(pos[y],br[x]-br[y]);

        swap(w[pos[x]],w[pos[y]]);
        swap(pos[x],pos[y]);
    }else change(pos[x],1);
}

void rem(int x){
    br[x]--;

    int z=pos[x];
    for(int s=10;s>=0;s--){
        if(pr[z][s]!=0 and br[w[pr[z][s]]]>br[x])z=pr[z][s];
    }

    int y=w[z];

    if(x!=y){
        change(pos[x],br[y]-(br[x]+1));
        change(pos[y],br[x]-br[y]);

        swap(w[pos[x]],w[pos[y]]);
        swap(pos[x],pos[y]);
    }else{
        change(pos[x],-1);
    }
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n>>q;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        maxs=max(maxs,a[i]);

        bucket[i]=i/bucket_sz;
    }

    for(int i=1;i<=maxs;i++)pos[i]=w[i]=i;

    for(int i=1;i<=maxs;i++){
        if(i<=maxs/2)nxt[i][0]=maxs-i+1;
        else nxt[i][0]=maxs-i+2;
    }
    if(maxs%2==1)nxt[maxs/2+1][0]=maxs/2+1;

    for(int i=1;i<=maxs;i++)pr[nxt[i][0]][0]=i;

    if(maxs%2==1)pr[maxs/2+1][0]=maxs/2+2;
    else pr[maxs/2+1][0]=maxs/2;
    pr[1][0]=0;

    calcdp();

    for(int i=1;i<=q;i++){
        cin>>qs[i].l>>qs[i].r;
        qs[i].id=i;
    }

    sort(qs+1,qs+q+1);

    l=1; r=0;
    for(int i=1;i<=q;i++){
        while(r<qs[i].r){
            r++; add(a[r]);
        }

        while(l>qs[i].l){
            l--; add(a[l]);
        }

        while(r>qs[i].r){
            rem(a[r]); r--;
        }

        while(l<qs[i].l){
            rem(a[l]); l++;
        }

        res[qs[i].id]=ans;
    }

    for(int i=1;i<=q;i++){
        cout<<res[i]<<"\n";
    }
    
    return 0;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 3 ms 1988 KB Output is correct
4 Correct 23 ms 16988 KB Output is correct
5 Correct 49 ms 33620 KB Output is correct
6 Correct 78 ms 50264 KB Output is correct
7 Correct 75 ms 50256 KB Output is correct
8 Correct 78 ms 50256 KB Output is correct
9 Correct 81 ms 50264 KB Output is correct
10 Correct 82 ms 50260 KB Output is correct
11 Correct 86 ms 50268 KB Output is correct
12 Correct 81 ms 50452 KB Output is correct
13 Correct 86 ms 50260 KB Output is correct
14 Correct 75 ms 50264 KB Output is correct
15 Correct 73 ms 50256 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 3 ms 1988 KB Output is correct
4 Correct 23 ms 16988 KB Output is correct
5 Correct 49 ms 33620 KB Output is correct
6 Correct 78 ms 50264 KB Output is correct
7 Correct 75 ms 50256 KB Output is correct
8 Correct 78 ms 50256 KB Output is correct
9 Correct 81 ms 50264 KB Output is correct
10 Correct 82 ms 50260 KB Output is correct
11 Correct 86 ms 50268 KB Output is correct
12 Correct 81 ms 50452 KB Output is correct
13 Correct 86 ms 50260 KB Output is correct
14 Correct 75 ms 50264 KB Output is correct
15 Correct 73 ms 50256 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 3 ms 2180 KB Output is correct
19 Correct 24 ms 17072 KB Output is correct
20 Correct 49 ms 33912 KB Output is correct
21 Correct 77 ms 50600 KB Output is correct
22 Correct 77 ms 50540 KB Output is correct
23 Correct 76 ms 50516 KB Output is correct
24 Correct 77 ms 50512 KB Output is correct
25 Correct 75 ms 50536 KB Output is correct
26 Correct 76 ms 50512 KB Output is correct
27 Correct 78 ms 50512 KB Output is correct
28 Correct 80 ms 50524 KB Output is correct
29 Correct 78 ms 50524 KB Output is correct
30 Correct 77 ms 50516 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 3 ms 1988 KB Output is correct
4 Correct 23 ms 16988 KB Output is correct
5 Correct 49 ms 33620 KB Output is correct
6 Correct 78 ms 50264 KB Output is correct
7 Correct 75 ms 50256 KB Output is correct
8 Correct 78 ms 50256 KB Output is correct
9 Correct 81 ms 50264 KB Output is correct
10 Correct 82 ms 50260 KB Output is correct
11 Correct 86 ms 50268 KB Output is correct
12 Correct 81 ms 50452 KB Output is correct
13 Correct 86 ms 50260 KB Output is correct
14 Correct 75 ms 50264 KB Output is correct
15 Correct 73 ms 50256 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 3 ms 2180 KB Output is correct
19 Correct 24 ms 17072 KB Output is correct
20 Correct 49 ms 33912 KB Output is correct
21 Correct 77 ms 50600 KB Output is correct
22 Correct 77 ms 50540 KB Output is correct
23 Correct 76 ms 50516 KB Output is correct
24 Correct 77 ms 50512 KB Output is correct
25 Correct 75 ms 50536 KB Output is correct
26 Correct 76 ms 50512 KB Output is correct
27 Correct 78 ms 50512 KB Output is correct
28 Correct 80 ms 50524 KB Output is correct
29 Correct 78 ms 50524 KB Output is correct
30 Correct 77 ms 50516 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 3 ms 2140 KB Output is correct
35 Correct 3 ms 2140 KB Output is correct
36 Correct 4 ms 2092 KB Output is correct
37 Correct 15 ms 8792 KB Output is correct
38 Correct 16 ms 8796 KB Output is correct
39 Correct 33 ms 17240 KB Output is correct
40 Correct 65 ms 34128 KB Output is correct
41 Correct 97 ms 50924 KB Output is correct
42 Correct 99 ms 51024 KB Output is correct
43 Correct 101 ms 51004 KB Output is correct
44 Correct 102 ms 50928 KB Output is correct
45 Correct 98 ms 50772 KB Output is correct
46 Correct 106 ms 51024 KB Output is correct
47 Correct 101 ms 50776 KB Output is correct
48 Correct 96 ms 50936 KB Output is correct
49 Correct 95 ms 50832 KB Output is correct
50 Correct 94 ms 51024 KB Output is correct
51 Correct 97 ms 51028 KB Output is correct
52 Correct 98 ms 50932 KB Output is correct
53 Correct 99 ms 51012 KB Output is correct
54 Correct 98 ms 50776 KB Output is correct
55 Correct 102 ms 51000 KB Output is correct
56 Correct 98 ms 50820 KB Output is correct
57 Correct 97 ms 50832 KB Output is correct
58 Correct 98 ms 50920 KB Output is correct
59 Correct 96 ms 51024 KB Output is correct
60 Correct 96 ms 50896 KB Output is correct

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 3 ms 1988 KB Output is correct
14 Correct 23 ms 16988 KB Output is correct
15 Correct 49 ms 33620 KB Output is correct
16 Correct 78 ms 50264 KB Output is correct
17 Correct 75 ms 50256 KB Output is correct
18 Correct 78 ms 50256 KB Output is correct
19 Correct 81 ms 50264 KB Output is correct
20 Correct 82 ms 50260 KB Output is correct
21 Correct 86 ms 50268 KB Output is correct
22 Correct 81 ms 50452 KB Output is correct
23 Correct 86 ms 50260 KB Output is correct
24 Correct 75 ms 50264 KB Output is correct
25 Correct 73 ms 50256 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 3 ms 2180 KB Output is correct
29 Correct 24 ms 17072 KB Output is correct
30 Correct 49 ms 33912 KB Output is correct
31 Correct 77 ms 50600 KB Output is correct
32 Correct 77 ms 50540 KB Output is correct
33 Correct 76 ms 50516 KB Output is correct
34 Correct 77 ms 50512 KB Output is correct
35 Correct 75 ms 50536 KB Output is correct
36 Correct 76 ms 50512 KB Output is correct
37 Correct 78 ms 50512 KB Output is correct
38 Correct 80 ms 50524 KB Output is correct
39 Correct 78 ms 50524 KB Output is correct
40 Correct 77 ms 50516 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 3 ms 2140 KB Output is correct
45 Correct 3 ms 2140 KB Output is correct
46 Correct 4 ms 2092 KB Output is correct
47 Correct 15 ms 8792 KB Output is correct
48 Correct 16 ms 8796 KB Output is correct
49 Correct 33 ms 17240 KB Output is correct
50 Correct 65 ms 34128 KB Output is correct
51 Correct 97 ms 50924 KB Output is correct
52 Correct 99 ms 51024 KB Output is correct
53 Correct 101 ms 51004 KB Output is correct
54 Correct 102 ms 50928 KB Output is correct
55 Correct 98 ms 50772 KB Output is correct
56 Correct 106 ms 51024 KB Output is correct
57 Correct 101 ms 50776 KB Output is correct
58 Correct 96 ms 50936 KB Output is correct
59 Correct 95 ms 50832 KB Output is correct
60 Correct 94 ms 51024 KB Output is correct
61 Correct 97 ms 51028 KB Output is correct
62 Correct 98 ms 50932 KB Output is correct
63 Correct 99 ms 51012 KB Output is correct
64 Correct 98 ms 50776 KB Output is correct
65 Correct 102 ms 51000 KB Output is correct
66 Correct 98 ms 50820 KB Output is correct
67 Correct 97 ms 50832 KB Output is correct
68 Correct 98 ms 50920 KB Output is correct
69 Correct 96 ms 51024 KB Output is correct
70 Correct 96 ms 50896 KB Output is correct
71 Correct 18 ms 9052 KB Output is correct
72 Correct 17 ms 9024 KB Output is correct
73 Correct 17 ms 9076 KB Output is correct
74 Correct 16 ms 9080 KB Output is correct
75 Correct 17 ms 9052 KB Output is correct
76 Correct 36 ms 17696 KB Output is correct
77 Correct 37 ms 17500 KB Output is correct
78 Correct 36 ms 17492 KB Output is correct
79 Correct 37 ms 17500 KB Output is correct
80 Correct 38 ms 17672 KB Output is correct
81 Incorrect 85 ms 34644 KB Output isn't correct
82 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 3 ms 1988 KB Output is correct
14 Correct 23 ms 16988 KB Output is correct
15 Correct 49 ms 33620 KB Output is correct
16 Correct 78 ms 50264 KB Output is correct
17 Correct 75 ms 50256 KB Output is correct
18 Correct 78 ms 50256 KB Output is correct
19 Correct 81 ms 50264 KB Output is correct
20 Correct 82 ms 50260 KB Output is correct
21 Correct 86 ms 50268 KB Output is correct
22 Correct 81 ms 50452 KB Output is correct
23 Correct 86 ms 50260 KB Output is correct
24 Correct 75 ms 50264 KB Output is correct
25 Correct 73 ms 50256 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 3 ms 2180 KB Output is correct
29 Correct 24 ms 17072 KB Output is correct
30 Correct 49 ms 33912 KB Output is correct
31 Correct 77 ms 50600 KB Output is correct
32 Correct 77 ms 50540 KB Output is correct
33 Correct 76 ms 50516 KB Output is correct
34 Correct 77 ms 50512 KB Output is correct
35 Correct 75 ms 50536 KB Output is correct
36 Correct 76 ms 50512 KB Output is correct
37 Correct 78 ms 50512 KB Output is correct
38 Correct 80 ms 50524 KB Output is correct
39 Correct 78 ms 50524 KB Output is correct
40 Correct 77 ms 50516 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 3 ms 2140 KB Output is correct
45 Correct 3 ms 2140 KB Output is correct
46 Correct 4 ms 2092 KB Output is correct
47 Correct 15 ms 8792 KB Output is correct
48 Correct 16 ms 8796 KB Output is correct
49 Correct 33 ms 17240 KB Output is correct
50 Correct 65 ms 34128 KB Output is correct
51 Correct 97 ms 50924 KB Output is correct
52 Correct 99 ms 51024 KB Output is correct
53 Correct 101 ms 51004 KB Output is correct
54 Correct 102 ms 50928 KB Output is correct
55 Correct 98 ms 50772 KB Output is correct
56 Correct 106 ms 51024 KB Output is correct
57 Correct 101 ms 50776 KB Output is correct
58 Correct 96 ms 50936 KB Output is correct
59 Correct 95 ms 50832 KB Output is correct
60 Correct 94 ms 51024 KB Output is correct
61 Correct 97 ms 51028 KB Output is correct
62 Correct 98 ms 50932 KB Output is correct
63 Correct 99 ms 51012 KB Output is correct
64 Correct 98 ms 50776 KB Output is correct
65 Correct 102 ms 51000 KB Output is correct
66 Correct 98 ms 50820 KB Output is correct
67 Correct 97 ms 50832 KB Output is correct
68 Correct 98 ms 50920 KB Output is correct
69 Correct 96 ms 51024 KB Output is correct
70 Correct 96 ms 50896 KB Output is correct
71 Correct 18 ms 9052 KB Output is correct
72 Correct 17 ms 9024 KB Output is correct
73 Correct 17 ms 9076 KB Output is correct
74 Correct 16 ms 9080 KB Output is correct
75 Correct 17 ms 9052 KB Output is correct
76 Correct 36 ms 17696 KB Output is correct
77 Correct 37 ms 17500 KB Output is correct
78 Correct 36 ms 17492 KB Output is correct
79 Correct 37 ms 17500 KB Output is correct
80 Correct 38 ms 17672 KB Output is correct
81 Incorrect 85 ms 34644 KB Output isn't correct
82 Halted 0 ms 0 KB -