# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588171 | Deepesson | Languages (IOI10_languages) | C++17 | 0 ms | 0 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"
#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];
std::unordered_map<int,int> mapa2[60];
ll tot[60];
ll duptot[60];
ll duptot2[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]);
auto it = mapa[i].find(ind);
if(it!=mapa[i].end())