Submission #1171661

#	Time	Username	Problem	Language	Result	Execution time	Memory
1171661		aufan	Diversity (CEOI21_diversity)	C++20	64 / 100	7094 ms	3400 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<int,int> pii;
typedef pair<char,char> pcc;
typedef pair<pii,int> ipii;
typedef pair<pii,pii> ipiii;
const int MAXN = 3e5+10;
const int SQRT = 600;

int n, q, a[MAXN], cnt[MAXN];
vector <ipii> que;

int l=1,r=0, cnt2[MAXN];
int nxl[MAXN], nxr[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(), [&](auto a, auto 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; 
    });

    nxl[0] = 0, nxr[0] = n+1, nxl[n+1] = 0, nxr[n+1] = n+1;
    cnt2[0] = MAXN;
    for(auto [xx, idx] : que){
        int le = xx.fi, ri = xx.se;
        while (r + 1 <= ri) {
            r += 1;

            int x = a[r];
            if (cnt[x] != 0) {
                    cnt2[cnt[x]] -= 1;
                    if (cnt2[cnt[x]] == 0) {
                            if (cnt2[cnt[x] + 1] == 0) {
                                    nxr[cnt[x] + 1] = nxr[cnt[x]];
                                    nxl[nxr[cnt[x]]] = cnt[x] + 1;
                                    nxl[cnt[x] + 1] = nxl[cnt[x]];
                                    nxr[nxl[cnt[x]]] = cnt[x] + 1;
                            } else {
                                    nxl[cnt[x] + 1] = nxl[cnt[x]];
                                    nxr[nxl[cnt[x]]] = cnt[x] + 1;
                            }

                            nxr[cnt[x]] = 0;
                            nxl[cnt[x]] = 0;
                    } else {
                            if (cnt2[cnt[x] + 1] == 0) {
                                    nxr[cnt[x] + 1] = nxr[cnt[x]];
                                    nxl[nxr[cnt[x]]] = cnt[x] + 1;
                                    nxl[cnt[x] + 1] = cnt[x];
                                    nxr[cnt[x]] = cnt[x] + 1;
                            }
                    }
            } else {
                    if (cnt2[cnt[x] + 1] == 0) {
                            nxr[cnt[x] + 1] = nxr[cnt[x]];
                            nxl[nxr[cnt[x]]] = cnt[x] + 1;
                            nxl[cnt[x] + 1] = cnt[x];
                            nxr[cnt[x]] = cnt[x] + 1;
                    }
            }       
            
            cnt[x] += 1;
            cnt2[cnt[x]] += 1;
    }

    while (l - 1 >= le) {
            l -= 1;

            int x = a[l];
            if (cnt[x] != 0) {
                    cnt2[cnt[x]] -= 1;
                    if (cnt2[cnt[x]] == 0) {
                            if (cnt2[cnt[x] + 1] == 0) {
                                    nxr[cnt[x] + 1] = nxr[cnt[x]];
                                    nxl[nxr[cnt[x]]] = cnt[x] + 1;
                                    nxl[cnt[x] + 1] = nxl[cnt[x]];
                                    nxr[nxl[cnt[x]]] = cnt[x] + 1;
                            } else {
                                    nxl[cnt[x] + 1] = nxl[cnt[x]];
                                    nxr[nxl[cnt[x]]] = cnt[x] + 1;
                            }

                            nxr[cnt[x]] = 0;
                            nxl[cnt[x]] = 0;
                    } else {
                            if (cnt2[cnt[x] + 1] == 0) {
                                    nxr[cnt[x] + 1] = nxr[cnt[x]];
                                    nxl[nxr[cnt[x]]] = cnt[x] + 1;
                                    nxl[cnt[x] + 1] = cnt[x];
                                    nxr[cnt[x]] = cnt[x] + 1;
                            }
                    }
            } else {
                    if (cnt2[cnt[x] + 1] == 0) {
                            nxr[cnt[x] + 1] = nxr[cnt[x]];
                            nxl[nxr[cnt[x]]] = cnt[x] + 1;
                            nxl[cnt[x] + 1] = cnt[x];
                            nxr[cnt[x]] = cnt[x] + 1;
                    }
            }
            
            cnt[x] += 1;
            cnt2[cnt[x]] += 1;
    }

    while (r - 1 >= ri) {
            int x = a[r];
            if (cnt[x] != 1) {
                    cnt2[cnt[x]] -= 1;
                    if (cnt2[cnt[x]] == 0) {
                            if (cnt2[cnt[x] - 1] == 0) {
                                    nxr[cnt[x] - 1] = nxr[cnt[x]];
                                    nxl[nxr[cnt[x]]] = cnt[x] - 1;
                                    nxl[cnt[x] - 1] = nxl[cnt[x]];
                                    nxr[nxl[cnt[x]]] = cnt[x] - 1;
                            } else {
                                    nxr[cnt[x] - 1] = nxr[cnt[x]];
                                    nxl[nxr[cnt[x]]] = cnt[x] - 1;
                            }

                            nxr[cnt[x]] = 0;
                            nxl[cnt[x]] = 0;
                    } else {
                            if (cnt2[cnt[x] - 1] == 0) {
                                    nxr[cnt[x] - 1] = cnt[x];
                                    nxl[cnt[x] - 1] = nxl[cnt[x]];
                                    nxr[nxl[cnt[x]]] = cnt[x] - 1;
                                    nxl[cnt[x]] = cnt[x] - 1;
                            }
                    }
            } else {
                    cnt2[cnt[x]] -= 1;
                    if (cnt2[cnt[x]] == 0) {
                            nxr[cnt[x] - 1] = nxr[cnt[x]];
                            nxl[nxr[cnt[x]]] = cnt[x] - 1;

                            nxr[cnt[x]] = 0;
                            nxl[cnt[x]] = 0;
                    }
            }

            cnt[x] -= 1;
            cnt2[cnt[x]] += 1;

            r -= 1;
    }

    while (l + 1 <= le) {
            int x = a[l];  
            if (cnt[x] != 1) {
                    cnt2[cnt[x]] -= 1;
                    if (cnt2[cnt[x]] == 0) {
                            if (cnt2[cnt[x] - 1] == 0) {
                                    nxr[cnt[x] - 1] = nxr[cnt[x]];
                                    nxl[nxr[cnt[x]]] = cnt[x] - 1;
                                    nxl[cnt[x] - 1] = nxl[cnt[x]];
                                    nxr[nxl[cnt[x]]] = cnt[x] - 1;
                            } else {
                                    nxr[cnt[x] - 1] = nxr[cnt[x]];
                                    nxl[nxr[cnt[x]]] = cnt[x] - 1;
                            }

                            nxr[cnt[x]] = 0;
                            nxl[cnt[x]] = 0;
                    } else {
                            if (cnt2[cnt[x] - 1] == 0) {
                                    nxr[cnt[x] - 1] = cnt[x];
                                    nxl[cnt[x] - 1] = nxl[cnt[x]];
                                    nxr[nxl[cnt[x]]] = cnt[x] - 1;
                                    nxl[cnt[x]] = cnt[x] - 1;
                            }
                    }
            } else {
                    cnt2[cnt[x]] -= 1;
                    if (cnt2[cnt[x]] == 0) {
                            nxr[cnt[x] - 1] = nxr[cnt[x]];
                            nxl[nxr[cnt[x]]] = cnt[x] - 1;

                            nxr[cnt[x]] = 0;
                            nxl[cnt[x]] = 0;
                    }
            }

            cnt[x] -= 1;
            cnt2[cnt[x]] += 1;

            l += 1;
    }

        // cout << "donemove\n";

        vector <int> vec; 
        int in = nxr[0];
        while(in!=n+1){
            // cout << in << ' ' << dif[in] << " dif\n";
            vec.pb(in); // value, len
            in = nxr[in];
        }
        reverse(vec.begin(), vec.end());

        ll res = 0, f = 0, num = 0, cur = 0, pref = 0, suf = 0;
                for (auto x : vec) {
                        ll c = cnt2[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';
}

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