# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487236 | nickmet2004 | Diversity (CEOI21_diversity) | C++11 | 0 ms | 204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 3e5 + 5;
int n , q , a[N];
int P[N] , p[N];
main (){
cin >> n >> q;
for(int i = 1; i <= n; ++i)cin >> a[i];
int l , r;
for(int i = 1; i <= q; ++i)cin >> l >> r;
sort(a + 1 , a + n + 1);
vector<int> v{0};
int k = 1;
for(int i = 1; i <= n; ++i){
if(a[i] == a[i + 1])k++;
else v.emplace_back(k),k=1;
}
//for(int x : v)cout << x << " ";cout << endl;
for(int i =1; i < v.size(); ++i){
p[i] = p[i - 1] + v[i];
P[i] = P[i - 1] + v[i] * i;
//cout << P[i] << " ";
}
int sz = v.size() - 1,ans=0;
for(int i =1; i < v.size(); ++i){
int x = v[i];
//cout << x << " ";
//cout << P[sz] - P[i] - (i - 1) * p[sz] << "s"<<endl;
ans += x * x - x*(x - 1)/2 + x * ((P[sz] - P[i]) - (i - 1) * (p[sz] - p[i]));
}
cout << ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |