Submission #292286

#TimeUsernameProblemLanguageResultExecution timeMemory
292286amiratouLanguages (IOI10_languages)C++14
65 / 100
2266 ms2272 KiB
#include <bits/stdc++.h> #include "grader.h" #include "lang.h" #define SZ 100 #define fi first #define se second using namespace std; map<int,pair<double,double> > freq[56]; void excerpt(int *E) { map<int,double> mymap; for (int i = 0; i < SZ; ++i) mymap[E[i]]++; double maxi=1e18,sz=(double)(SZ); int idx=-1; for (int l = 0; l < 56; ++l) { double cost=0; for(auto it:mymap){ double h=0; if(freq[l].count(it.fi)) h=freq[l][it.fi].fi/freq[l][it.fi].se; cost+=abs((it.se/sz)-h); } if(cost<=maxi)maxi=cost,idx=l; } assert(idx!=-1); int L=language(idx); for(auto it:mymap){ freq[L][it.fi].fi+=(it.se/sz); freq[L][it.fi].se++; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...