# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363389 | cig32 | Languages (IOI10_languages) | C++17 | 267 ms | 5996 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"
using namespace std;
int word[65536][56];
int totcnt[65536];
double newtiles[56];
int anscnt[56];
int test_case=0;
int space_character;
void excerpt(int *a){
test_case++;
if(test_case==20){
int mm=0;
for(int i=0;i<65536;i++){
mm=max(mm,totcnt[i]);
}
for(int i=0;i<65536;i++){
if(mm==totcnt[i]){
space_character=i;
break;
}
}
}
double s[56];
double m=0;
int newcnt=0;
for(int j=0;j<56;j++)s[j]=0;
for(int j=0;j<100;j++){
for(int k=0;k<56;k++){
if(a[j]==space_character)continue;
if(totcnt[a[j]])s[k]+=word[a[j]][k]*1.0/totcnt[a[j]];
else newcnt++;
}
}
newcnt/=56;
for(int j=0;j<56;j++){
s[j]+=0.05*(100-abs(newtiles[j]-newcnt));
m=max(m,s[j]);
}
for(int j=0;j<100;j++){
totcnt[a[j]]++;
}
int ans;
for(int j=0;j<56;j++){
if(s[j]==m){
ans=language(j);
break;
}
}
newtiles[ans]=(newtiles[ans]*anscnt[ans]+newcnt)*1.0;
anscnt[ans]++;
newtiles[ans]/=anscnt[ans];
for(int j=0;j<100;j++){
word[a[j]][ans]++;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |