#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
map<int,int>mp[55];
int C[55];
void excerpt(int *E) {
pair<double,int>mx={0,0};
for(int i=0;i<55;i++){
if(C[i]==0)continue;
int c=0;
for(int j=0;j<100;j++){
c+=mp[i][E[j]];
}
mx=max(mx,{(double)c/C[i],i});
}
language(0);
return;
int l=language(mx.second);
C[l]++;
for(int i=0;i<100;i++){
mp[l][E[i]]++;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
143 ms |
256 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
131 ms |
376 KB |
Output isn't correct - 1.91% |