oj.uz

답안 #1097556

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097556 2024-10-07T14:54:34 Z alexander707070 Diversity (CEOI21_diversity) C++14
0 / 100
 1 ms 348 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];
    if(br[x]>br[w[nxt[x][0]]]){
        for(int s=17;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=17;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
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -