Submission #1114535

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114535		vjudge1	Diversity (CEOI21_diversity)	C++17	64 / 100	7078 ms	22624 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]]++;
        vi ps;
        for (auto it : mp) ps.push_back(it.ss);
        sort(ps.begin(),ps.end());
        deque<int> dq;
        int coin = 0;
        while (!ps.empty()) {
            if (!coin) dq.push_front(ps.back());
            else dq.push_back(ps.back());
            coin^=1;
            ps.pop_back();
        }
        int ans = 0;
        int cur = 1;
        for (auto it : dq) {
            int r = cur+it-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: 4 / 4
• Subtask 2: 10 / 10
• Subtask 3: 8 / 8
• Subtask 4: 16 / 16
• Subtask 5: 26 / 26
• Subtask 6: 0 / 36