#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
#include "grader.h"
#include "lang.h"
#define SZ 100
//int language(int x) { cout << x << "\n"; return 0; }
int m[56][65536];
map<int,int> tmp;
int tot[56];
double tri(int lang) {
if (tot[lang] == 0) return MOD;
double dif = 0, lef = 100;
for (auto a: tmp) {
lef -= (double)m[lang][a.f]/tot[lang];
double z = a.s-(double)m[lang][a.f]/tot[lang];
dif += abs(z);
}
dif += lef;
return dif;
}
void excerpt(int *E) {
pair<double,int> bes = {MOD,0};
tmp.clear();
F0R(i,100) tmp[E[i]] ++;
F0R(i,56) bes = min(bes,{tri(i),i});
int x = language(bes.s);
tot[x] ++;
F0R(i,100) m[x][E[i]] ++;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
347 ms |
3168 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Partially correct |
354 ms |
3064 KB |
Output is partially correct - 71.39% |
