Submission #1114499

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114499		vjudge1	Diversity (CEOI21_diversity)	C++17	0 / 100	1 ms	336 KiB

diversity

//Dost SEFEROĞLU
#include <bits/stdc++.h>
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<    
#define all(cont) cont.begin(),cont.end()
#define vi vector<int>
const int MOD = 1e9+7,inf = 2e18;
const int N = 2e5+50,Q = 2e5+50;
 
void solve() { 
    int n,q;
    cin >> n >> q;
    vi a(n+1);
    for (int i=1;i<=n;i++) cin >> a[i];
    while (q--) {
        int l,r;
        cin >> l >> r;
        n = r-l+1;
        map<int,int> mp;
        for (int j = l;j<=r;j++) mp[a[j]]++;
        vector<pii> ps;
        for (auto it : mp) ps.push_back(it);
        sort(ps.begin(),ps.end(),[&](pii p1,pii p2){
            return p1.ss*(p1.ss+1) > (p1.ss-p2.ss)*(n-p2.ss+1)+p2.ss*(p2.ss+1);
        });
        int ans = 0;
        int cur = 1;
        for (auto it : ps) {
            int r = cur+it.ss-1;
            ans+=n*(n+1)/2-cur*(cur-1)/2-(n-r)*(n-r+1)/2;
            cur = r+1;
        }
        cout << ans << '\n';
    }
}                    
                             
signed main() { 
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Dodi
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t; 
    while (t --> 0) solve();
}

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