Submission #588167

#TimeUsernameProblemLanguageResultExecution timeMemory
588167DeepessonLanguages (IOI10_languages)C++17
66 / 100
3792 ms90740 KiB
#include <bits/stdc++.h> #include "lang.h" #include "grader.h" #define fi first #define se second #define pb push_back using ll = long long; ll lang[60][66000]; std::unordered_map<int,int> mapa[60]; ll tot[60]; ll duptot[60]; void excerpt(int *E) { { int best=0;double score=0; for(int i=0;i!=60;++i){ if(!tot[i])continue; double bonus=0; /* for(int j=0;j!=100;++j){ bonus+=(double)lang[i][E[j]]; } bonus/=tot[i];*/ for(int j=0;j!=99;++j){ ll ind = E[j] * 100000 + (E[j+1]); bonus+=(double)mapa[i][ind]*8.0; } bonus/=(double)duptot[i]; if(bonus>=score){ best=i; score=bonus; continue; } } int k = language(best); for(int i=0;i!=100;++i){ tot[k]++; lang[k][E[i]]++; } for(int j=0;j!=99;++j){ ll ind = E[j] * 100000 + (E[j+1]); mapa[k][ind]++; duptot[k]++; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...