# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
512681 | lovro_nidogon1 | Languages (IOI10_languages) | C++14 | 0 ms | 0 KiB |
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 "lang.h"
#include "grader.h"
#define bretrun return
#define sq(int x, int y) (x+y)*(x+y)
using namespace std;
int freq[56][70001], nocur[56], spac, cfreq[70001];
void excerpt(int e[101]) {
memset(cfreq, 0, sizeof(cfreq));
for(int i = 0; i < 100; i++) cfreq[e[i]]++;
int exp = 0;
int sd = 1e9;
for(int i = 0; i < 56; i++) {
int csd = 0;
for(int j = 0; j < 65536; j++) {
csd += sq(cfreq[j] * nocur[i], -freq[i][j]);
}
if(csd < sd) sd = csd, exp = j;
}
int ca = language(exp);
for(int i = 0; i < 65536; i++) freq[ca][i] += cfreq[i];
nocur[ca]++;
}