제출 #1161592

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1161592		antonn	Diversity (CEOI21_diversity)	C++20	64 / 100	4466 ms	4568 KiB

diversity

#include <bits/stdc++.h>

#define F first
#define S second
 
using namespace std;
using ll = long long;
using pi = pair<int, int>;
using vi = vector<int>;
 
template<class T> bool ckmin(T& a, T b) { return b < a ? a = b, true : false; }
template<class T> bool ckmax(T& a, T b) { return a < b ? a = b, true : false; }

const int N = 3e5 + 7;

int a[N], cnt[N];

ll get(vector<int> v) {
    int n = v.size();
    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        set<int> s;
        for (int j = i; j < n; ++j) {
            s.insert(v[j]);
            ans += s.size();
        }
    }
    return ans;
}

/**
10 1
1 3 3 2 1 3 3 1 1 3 
1 10

6 1
2 4 3 5 4 3 
1 6
**/

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    
    int n, q; cin >> n >> q;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    
    for (int iq = 1; iq <= q; ++iq) {
        int l, r; cin >> l >> r;
        for (int j = l; j <= r; ++j) ++cnt[a[j]];
        
        deque<int> dq;
        for (int j = 1; j < N; ++j) if (cnt[j] != 0) dq.push_back(cnt[j]);
        sort(dq.begin(), dq.end());
        
        vector<int> v(dq.size());
        
        int i = 0, j = dq.size() - 1;
        while (i < j) {
            v[i] = dq.front();
            dq.pop_front();
            v[j] = dq.front();
            dq.pop_front();
            ++i;
            --j;
        }
        if (!dq.empty()) v[i] = dq.front();
        
        ll len = r - l + 1;
        ll ans = len * (len + 1) / 2;
        ll s = 0;
        for (int j = 0; j < v.size(); ++j) {
            ans += s * (len - s);
            s += v[j];
        }
        cout << ans << "\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