#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
int a[50][100000], b[100000];
void excerpt (int* E) {
int cnt[100000];
memset (cnt, 0, sizeof (cnt));
std::set <int> s;
for (int i = 0; i < 100; i++) {
cnt[E[i]]++;
s.insert (E[i]);
}
double mx = 0;
int x = 0;
for (int i = 0; i < 50; i++) {
double points = 0;
for (int j : s) {
if (b[j]) points += cnt[j] * (a[i][j] / b[j]);
}
if (points > mx) {
mx = points;
x = i;
}
}
x = language (x);
for (int i = 0; i < 100; i++) {
b[E[i]]++;
a[x][E[i]]++;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
22 ms |
2852 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
21 ms |
2920 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |