# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
487590 | 2021-11-16T09:12:30 Z | nickmet2004 | Diversity (CEOI21_diversity) | C++11 | 1 ms | 204 KB |
#include<bits/stdc++.h> #define int long long using namespace std; const int N = 3e6; 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; } sort(v.begin() , v.end()); //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]; int ok = 1; if(i==sz)ok=0; //cout << x << " "; //cout << P[sz] - P[i] - (i - 1) * p[sz] << "s"<<endl; ans += x * x - x*(x - 1)/2 + ok*x * ((P[sz] - P[i]) - (i - 1) * (p[sz] - p[i])); } cout << ans; } /// 1 1 2 2 3 4 5 5 5 5
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Incorrect | 0 ms | 204 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Incorrect | 0 ms | 204 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Incorrect | 0 ms | 204 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |