# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
632308 | ggoh | Languages (IOI10_languages) | C++14 | 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 "grader.h"
using namespace std;
int V[56][65536];
void excerpt(int *E)
{
int l=0,maxi=-1;
for(int j=0;j<56;j++)
{
int kind=0;
int v[65536]={};
for(int i=0;i<100;i++)
{
if(V[j][E[i]] && v[E[i]]=0)
{
kind++;
v[E[i]]=1;
}
}
if(kind>maxi)
{
maxi=kind;
l=j;
}
}
/*
vector<int>N;
for(int j=0;j<56;j++)
{
int kind=0;
for(int i=0;i<100;i++)
{
if(V[j][E[i]])
{
kind++;
}
}
if(kind==maxi)
{
N.push_back(j);
}
}
srand(time(NULL));
int r=rand();
r%=(int)(N.size());
l=N[r];*/
int L=language(l);
for(int i=0;i<100;i++)
{
V[L][E[i]]++;
}
}