# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
632323 | 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;
typedef long long lint;
int V[56][65536];
map<lint,int>W[56];
void excerpt(int *E)
{
int l=0,maxi=0;
vector<lint>T;
foR(int i=0;i<99;i++)
{
T.push_back(1ll*E[i]*65536+E[i+1]);
}
sort(T.begin(),T.end());
T.erase(unique(T.begin(),T.end()),T.end());
for(int j=0;j<56;j++)
{
int kind=0;
for(auto &i:T)
{
if(W[j][i])kind++;
}
if(kind>maxi)
{
maxi=kind;
l=j;
}
}