제출 #1090808

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1090808		farica	Diversity (CEOI21_diversity)	C++14	0 / 100	1 ms	600 KiB

diversity

#include <bits/stdc++.h>
#define ll long long

using namespace std;

const int MAX_N = 3e5;

int b[MAX_N + 5];

void solve() {
    int n, q;
    cin >> n >> q;
    set<int>s;
    for(int i=0; i<n; ++i) {
        int x;
        cin >> x;
        ++b[x];
        s.insert(x);
    }
    int L, R;
    cin >> L >> R;
    ll ans = 0, cnt = 0, cnt2 = 0;
    for(auto it = s.begin(); it != s.end(); ++it) {
        int cur = *it;
        cnt2 += b[cur];
        cnt += cnt2;
        ans += cnt * b[cur];
    }
    cout << ans << endl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    int t = 1;
    while(t--) solve();

    return 0;
}

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