제출 #1171650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1171650		ByeWorld	Diversity (CEOI21_diversity)	C++20	100 / 100	1195 ms	15188 KiB

diversity

#include <bits/stdc++.h>
#define int long long
#define ll long long
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,int> ipii;
const int MAXN = 3e5+10;



signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n, q;
    cin>>n>>q;
        vector<int> a(n + 1);
    for(int i=1; i<=n; i++)
        cin>>a[i]; 
    
     vector<pair<pair<int, int>, int>> qr(q);
        for (int i = 0; i < q; i++) {
                cin >> qr[i].fi.fi >> qr[i].fi.se;
                qr[i].se = i;
        }
        sort(qr.begin(), qr.end(), [&](auto x, auto y) {
                if (x.fi.fi / 500 != y.fi.fi / 500) return x.fi.fi / 500 < y.fi.fi / 500;
                if ((x.fi.fi / 500) % 2 == 0) return x.fi.se < y.fi.se;
                return x.fi.se > y.fi.se;
        });


        // cout << "donemove\n";
int pl = 1, pr = 0;
        vector<int> cnt(333333), cnt2(n + 1), ans(q), nxr(333333), nxl(333333);
        for (int i = 0; i < q; i++) {
                while (pr + 1 <= qr[i].fi.se) {
                        pr += 1;

                        int x = a[pr];
                        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 (pl - 1 >= qr[i].fi.fi) {
                        pl -= 1;

                        int x = a[pl];
                        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 (pr - 1 >= qr[i].fi.se) {
                        int x = a[pr];
                        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;

                        pr -= 1;
                }

                while (pl + 1 <= qr[i].fi.fi) {
                        int x = a[pl];  
                        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;

                        pl += 1;
                }

                vector<int> v = {nxr[0]};
                while (nxr[v.back()] != 0) v.push_back(nxr[v.back()]);
                reverse(v.begin(), v.end());

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

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

            auto calc = [&](ll y) {
                ll res = (((x * y) * (x * y + 1)) >>1) + 
                    x * x * ((y - 1) * y * (2 * (y - 1) + 1) / 6 + 
                        (((y - 1) * y / 2))>>1);
                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)>>1) * x) * 
                (ri * x) + (le * x) * (((ri * (ri + 1))>>1) * x);
            // cout << "b: " << res << '\n';

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

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

            pref = (((le * (le + 1))>>1) * x) + (pref + num * le) + 
                (((ri * (ri + 1))>>1) * x + (ri * x) * (le + cur));
            suf = (((ri * (ri + 1))>>1) * x) + (suf + num * ri) + 
                (((le * (le + 1))>>1) * x + (le * x) * (ri + cur));
            
            num += c * x;
            cur += c;
            f ^= (c & 1);
        }
        ans[qr[i].se] = res;
    }
    for(int i=0; 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: 36 / 36