Submission #1150148

#TimeUsernameProblemLanguageResultExecution timeMemory
1150148eri16Diversity (CEOI21_diversity)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n,q; cin>>n>>q; int arr[n]; for (int i=0; i<n; i++){ cin>>arr[i]; } int x,y,t=1; cin>>x>>y; vector <int> v; sort (arr,arr+y); for (int i=1; i<y+1; i++){ if (arr[i]==arr[i-1]){t++;} else{v.push_back((t*(t+1))/2);t=1;} } if (t!=1){v.push_back(((t-1)*t)/2);} sort(v.begin(), v.end()); reverse(v.begin(), v.end()); int k,l; //for (int i=0; i<v.size(); i++){cout<<v[i]<<' ';} //cout<<endl; t=0; for (int i=v.size(); i>1; i--){ k=v[i-1]; l=v[i-2]; v.pop_back(); v.pop_back(); v.push_back((k+l+t)*2); t++; } cout<<v[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...