Submission #1214659

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214659		JuanJL	Diversity (CEOI21_diversity)	C++20	64 / 100	156 ms	27376 KiB

diversity

#include <bits/stdc++.h>

#define fst first
#define snd second
#define pb push_back
#define forn(i,a,b) for(int i = a; i<b; i++)
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset(a,v,sizeof(a))
#define FIN ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
typedef long long ll;

const int MAXN = 300000+4;

int main(){FIN;
    ll n; cin>>n;
    ll q; cin>>q;
    vector<ll> a(n); forn(i,0,n) cin>>a[i];

    map<ll,ll> mp; 
    forn(i,0,n) mp[a[i]]++;

    vector<pair<ll,ll>> ord;
    for(auto i:mp) ord.pb({i.snd,i.fst});

    sort(ALL(ord));

    pair<ll,ll> ra[MAXN];
    forn(i,0,MAXN) ra[i]={-1,-1};

    ll l ,r; l = 0; r = n-1;
    forn(i,0,SZ(ord)){
        if(i%2==0){
            forn(j,l,l+ord[i].fst){
                a[j]=ord[i].snd;
            }
            ra[ord[i].snd].fst=l;
            l+=ord[i].fst;
            ra[ord[i].snd].snd=l;
        }else{
            for(int j = r; j>r-ord[i].fst; j--){
                a[j]=ord[i].snd;
            }
            ra[ord[i].snd].snd=r+1;
            r-=ord[i].fst;
            ra[ord[i].snd].fst=r+1;
        }
    }

    //forn(i,0,n) cout<<a[i]<<" "; cout<<'\n';

    cin>>l>>r;
    ll res = 0;

    forn(i,0,MAXN){
        if(ra[i].fst!=-1){
            ll tam=(ra[i].snd-ra[i].fst);
            res+=(tam*(tam+1))/2;
            ll ca = 0;
            /*ca+= (n-ra[i].snd)*(ra[i].snd);
            ca+= ra[i].fst*(n-(ra[i].fst));*/
            ca+= ra[i].fst*tam;
            ca+= (n-ra[i].snd)*tam;
            ca+= ra[i].fst*(n-ra[i].snd);
            res+=ca;
            /*cout<<i<<" "<<ra[i].fst<<" "<<ra[i].snd<<'\n';
            cout<<res<<'\n';*/
        }
    }
    /*forn(i,0,n){
        set<ll> s;
        forn(j,i,n){
            s.insert(a[j]);
            res+=SZ(s);
        }
    }*/

    cout<<res<<'\n';
    
    
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 16 / 16
• Subtask 5: 26 / 26
• Subtask 6: 0 / 36