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>
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |