# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
512813 | algorithm16 | 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<iostream>
#include<vector>
#include<unordered_set>
#include<algorithm>
#include "grader.h"
#include "lang.h"
using namespace std;
typedef long long int llint;
unordered_set <llint> s[65],s1;
llint e[105],cnt1[70005];
vector <llint> v;
void excerpt(int *E) {
//s1.clear();
for(int i=0;i<100;i++) {
e[i]=E[i];
cnt1[e[i]]+=1;
//s1.insert(e[i]);
v.push_back(e[i]);
if(i>=50) {
//s1.insert(e[i-1]*1e5+e[i]);
v.push_back(e[i-1]*1e5+e[i]);
}
//if(i && i%4) s1.insert(e[i-1]*1e5+e[i]);
//if(i>1 && i%4==0) s1.insert(e[i-2]*1e10+e[i-1]*1e5+e[i]);
}
for(int i=1;i<100;i+=e[i]%2+1) {
//s1.insert(e[i-1]*1e5+e[i]);
v.push_back(e[i-1]*1e5+e[i]);
}
for(int i=2;i<100;i+=e[i]%2+1) {
//s1.insert(e[i-2]*1e10+e[i-1]*1e5+e[i]);
v.push_back(e[i-2]*1e10+e[i-1]*1e5+e[i]);
}
llint mx=0,idx=0;
for(int i=0;i<56;i++) {
llint cnt=0;
for(int j=0;j<v.size();j++) {
if(v[j]<65536) cnt+=(s[i].find(v[j])!=s[i].end())*cnt1[v[j]]*20;
else cnt+=(s[i].find(v[j])!=s[i].end())*100;
}
if(cnt>mx) {
mx=cnt;
idx=i;
}
}
int l=language(idx);
for(int i=0;i<v.size();i++) {
s[l].insert(*it);
}
for(int i=0;i<100;i++) {
cnt1[e[i]]-=1;
}
}