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 "lang.h"
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
#define debug(x) [&] { auto _x = x; cerr << __LINE__ << ": " << #x << " = " << _x << endl; return _x; }()
double magic(double x) {
return pow(abs(x), 1);
}
template <typename T>
struct Data : map<T, int> {
int tot = 0;
double operator&(const Data<T> &o) const {
double ret = 0;
for (auto [k, v]: *this) {
ret += magic((double) v / tot - (o.count(k) ? (double) o.at(k) / o.tot : 0));
}
for (auto [k, v]: o) {
if (not this->count(k)) ret += magic((double) v / o.tot);
}
return ret;
}
void operator+=(const Data<T> &o) {
for (auto &[k, v]: o) {
(*this)[k] += v;
}
tot += o.tot;
}};
struct Profile {
Data<int> single;
Profile() {}
Profile(int *arr) {
for (int i = 0; i < 100; ++i) {
single[arr[i]]++;
}
single.tot = 100;
}
double operator&(const Profile &o) const {
return single & o.single;
}
void operator+=(const Profile &o) {
single += o.single;
}
} profile[56];
void excerpt(int *E) {
Profile p(E);
pair<double, int> mn{1e18, 0};
for (int i = 0; i < 56; ++i) {
mn = min(mn, {p & profile[i], i});
}
int ans = language(mn.second);
profile[ans] += p;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |