Submission #1229038

#TimeUsernameProblemLanguageResultExecution timeMemory
1229038raspyDiversity (CEOI21_diversity)C++20
0 / 100
7 ms4936 KiB
#include <bits/stdc++.h> #define vi vector<int> #define int long long using namespace std; const int N = 3e5+5; int ste[N]; int prs[N]; signed main() { for (int i = 1; i < N; i++) prs[i]=prs[i-1]+i; int n, q; cin >> n >> q; vi a(n); for (int&v:a) { cin >> v; ste[v]++; } cin >> q >> q; sort(ste, ste+N); int stl = 1, rez=0; for (int i = 0; i < N; i++) { if (ste[i] == 0) continue; int std = n-stl+1; rez += stl*std; rez += prs[std-1]-prs[std-ste[i]]; stl += ste[i]; } cout << rez << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...