Submission #1171599

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171599		ByeWorld	Diversity (CEOI21_diversity)	C++20	64 / 100	7092 ms	4936 KiB

diversity

#include <bits/stdc++.h>
// #pragma GCC optimize("O3", "Ofast")
// #define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<ll,ll> pii;
typedef pair<char,char> pcc;
typedef pair<pii,int> ipii;
typedef pair<pii,pii> ipiii;
const int MAXN = 3e5+10;
const int SQRT = 500;
const int MAXA = 1e5;
const int LOG = 20;
const int INF = 1e18+10;
const ld EPS = 1e-6;
const int MOD = 998244353;
int sum(int a, int b){ return (a+b)%MOD; }
void chsum(int &a, int b){ a = (a+b)%MOD; }
void chsub(int &a, int b){ a = (a+MOD-b)%MOD; }
int mul(int a, int b){ return (a*b)%MOD; }
void chmul(int &a, int b){ a = (a*b)%MOD; }
void chmn(int &a, int b){ a = min(a, b); }
void chmx(int &a, int b){ a = max(a, b); }

int n, q, a[MAXN], cnt[MAXN];
int siz;
vector <ipii> que;
inline bool cmp(ipii a, ipii b){
    if(a.fi.fi/SQRT != b.fi.fi/SQRT) a.fi.fi/SQRT < b.fi.fi/SQRT;
    if((a.fi.fi/SQRT) & 1) a.fi.se > b.fi.se;
    return a.fi.se < b.fi.se;
}

int l=1,r=0, dif[MAXN];
int nxl[MAXN], nxr[MAXN];
pii opt[MAXN]; 
ll ans[MAXN];

signed 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]; 
    
    for(int p=1; p<=q; p++){
        int l,r;cin>>l>>r;
        que.pb({{l,r}, p});
    }
    sort(que.begin(), que.end(), cmp);

    for(int i=0; i<=n+1; i++) nxl[i] = 0, nxr[i] = n+1;

    for(auto [xx, idx] : que){
        // move(xx.fi, xx.se);
        int le = xx.fi, ri = xx.se;
        while(le < l){
            l--; 
            dif[cnt[a[l]]]--; 
            bool zer = 0, one = 0;
            if(dif[cnt[a[l]]]==0) zer=1;

            cnt[a[l]]++; 
            dif[cnt[a[l]]]++;
            if(dif[cnt[a[l]]]==1) one=1;
            // lef(cnt[a[l]]-1, cnt[a[l]], zer, one);

            int le = cnt[a[l]]-1, ri = cnt[a[l]];
            
            int p = nxl[le], q = nxr[le];
            if(zer==1 && one==1){
                nxl[ri] = p; nxr[ri] = q; 
                nxr[p] = ri; nxl[q] = ri;
            }
            if(zer==1 && one==0){
                nxr[p] = q; nxl[q] = p;
            }
            if(zer==0 && one==1){ // gk pop, push
                // cout << p<<' '<<q<<"masuk\n";
                nxl[ri] = le; nxr[ri] = q;
                nxr[le] = ri;
                nxl[q] = ri; // ganti
            }
        }
        while(r < ri){
            r++; 
            dif[cnt[a[r]]]--; 
            bool zer = 0, one = 0;
            if(dif[cnt[a[r]]]==0) zer=1;

            cnt[a[r]]++; 
            dif[cnt[a[r]]]++;
            if(dif[cnt[a[r]]]==1) one=1;
            // lef(cnt[a[r]]-1, cnt[a[r]], zer, one);

            int le = cnt[a[r]]-1, ri = cnt[a[r]];

            int p = nxl[le], q = nxr[le];
            if(zer==1 && one==1){
                nxl[ri] = p; nxr[ri] = q; 
                nxr[p] = ri; nxl[q] = ri;
            }
            if(zer==1 && one==0){
                nxr[p] = q; nxl[q] = p;
            }
            if(zer==0 && one==1){ // gk pop, push
                // cout << p<<' '<<q<<"masuk\n";
                nxl[ri] = le; nxr[ri] = q;
                nxr[le] = ri;
                nxl[q] = ri; // ganti
            }

        // cout << l << ' ' << r << " lr\n";

        //     for(int i=0; i<=n+1; i++){
        //         cout << i << ' ' << nxl[i] << ' '<< nxr[i] << " nxr\n";
        //     }
        }
        while(l < le){
            bool zer = 0, one = 0;
            if(dif[cnt[a[l]]]==1) zer=1;
            dif[cnt[a[l]]]--; 
            cnt[a[l]]--; 

            if(dif[cnt[a[l]]]==0) one=1;
            dif[cnt[a[l]]]++; 
            // rig(cnt[a[l]]+1, cnt[a[l]], zer, one);
            int le = cnt[a[l]]+1, ri = cnt[a[l]];

            int p = nxl[le], q = nxr[le];
            if(zer==1 && one==1){
                nxl[ri] = p; nxr[ri] = q; 
                nxr[p] = ri; nxl[q] = ri;
            }
            if(zer==1 && one==0){
                nxr[p] = q; nxl[q] = p;
            }
            if(zer==0 && one==1){ // gk pop, push
                nxr[ri] = le; nxl[ri] = p;
                nxl[le] = ri;
                nxr[p] = ri; // ganti
            }
            l++; 
        }
        while(ri < r){
            bool zer = 0, one = 0;
            if(dif[cnt[a[r]]]==1) zer=1;
            dif[cnt[a[r]]]--; 
            cnt[a[r]]--; 

            if(dif[cnt[a[r]]]==0) one=1;
            dif[cnt[a[r]]]++; 
            // rig(cnt[a[r]]+1, cnt[a[r]], zer, one);
            int le = cnt[a[r]]+1, ri = cnt[a[r]];
            
            int p = nxl[le], q = nxr[le];
            if(zer==1 && one==1){
                nxl[ri] = p; nxr[ri] = q; 
                nxr[p] = ri; nxl[q] = ri;
            }
            if(zer==1 && one==0){
                nxr[p] = q; nxl[q] = p;
            }
            if(zer==0 && one==1){ // gk pop, push
                nxr[ri] = le; nxl[ri] = p;
                nxl[le] = ri;
                nxr[p] = ri; // ganti
            }
            r--;  
        }
        // cout << "donemove\n";

        vector <int> vec; 
        ll run = 0, lenreal = 0, in = nxr[0];
        // cout << ma.size() << " ma\n";
        // cout << idx << " idx\n";
        while(in!=n+1){
            // cout << in << ' ' << dif[in] << " dif\n";
            vec.pb(in); // value, len
            lenreal += 1ll*in*dif[in];
            in = nxr[in];
        }
        reverse(vec.begin(), vec.end());
        assert(vec.size() < 2*SQRT);

        ll res = 0, f = 0, num = 0, cur = 0, pref = 0, suf = 0;
        for(auto x : vec) {
            int c = dif[x];

            ll le = (c + (f ^ 1)) / 2, ri = (c + f) / 2;

            auto calc = [&](ll y) {
                ll res = (x * y) * (x * y + 1) / 2 + x * x * ((y - 1) * y * (2 * (y - 1) + 1) / 6 + (y - 1) * y / 2) / 2;
                return res;
            };

            // le to le and ri to ri
            res += calc(le);
            res += calc(ri);
            // cout << "a: " << res << '\n';

            // le to ri
            res += cur * le * x * ri * x + (le * (le + 1) / 2 * x) * (ri * x) + (le * x) * (ri * (ri + 1) / 2 * x);
            // cout << "b: " << res << '\n';

            // le to md
            res += (le * x) * pref;
            res += (le * (le + 1) / 2 * x) * num;
            // cout << "c: " << res << '\n';

            // md to ri
            res += suf * (ri * x);
            res += num * (ri * (ri + 1) / 2 * x);
            // cout << "d: " << res << '\n';

            pref = (le * (le + 1) / 2 * x) + (pref + num * le) + (ri * (ri + 1) / 2 * x + (ri * x) * (le + cur));
            suf = (ri * (ri + 1) / 2 * x) + (suf + num * ri) + (le * (le + 1) / 2 * x + (le * x) * (ri + cur));
            
            num += c * x;
            cur += c;
            f ^= (c % 2);

                // cout << pref << " " << suf << '\n';
        }
        ans[idx] = res;
    }
    for(int i=1; i<=q; i++) cout << ans[i] << '\n';
}
/*

    int ans = 0;
    for(int i=1; i<=300000; i++){
        int len = cnt[i];
        ans += len * (n-len);
        ans += len*(len+1)/2;
        if(cnt[i] != 0) vec.pb(cnt[i]);
    }
    sort(vec.rbegin(), vec.rend());
    siz = vec.size();
    opt.resize(siz);

    int l=siz/2, r=siz/2-1;
    for(int i=0; i<siz; i++){
        if(i%2==0) opt[++r] = vec[i];
        else opt[--l] = vec[i];
    }
    // for(auto in : opt) cout << in << ' ';
    // cout << '\n';
    for(int i=0; i<siz; i++){
        if(i!=0) pr[i] = pr[i-1]+opt[i];
        else pr[i] = opt[i];
    }
    for(int i=siz-1; i>=0; i--)
        su[i] = su[i+1]+opt[i];

    int nw = 0;
    for(int i=0; i<siz; i++){
        nw += (i==0?0:pr[i-1]) * (i+1==siz?0:su[i+1]);
    }

    cout << run+nw << '\n';
*/

Compilation message (stderr)

diversity.cpp:21:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   21 | const int INF = 1e18+10;
      |                 ~~~~^~~

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