Submission #1029717

#TimeUsernameProblemLanguageResultExecution timeMemory
1029717vjudge1Languages (IOI10_languages)C++17
0 / 100
4500 ms262144 KiB
#include"lang.h" #include"grader.h" #include<bits/stdc++.h> #define cir(i,a,b) for(int i=a;i<b;++i) using namespace std; using ulint=unsigned long long; map<vector<int>,unordered_set<int>> crsap; void excerpt(int*a){ const auto len=100; unordered_map<int,int> prob; cir(i,0,len-1){ for(auto&x:crsap[{a[i],a[i+1]}]) ++prob[x]; } cir(i,0,len-2){ for(auto&x:crsap[{a[i],a[i+1],a[i+2]}]) prob[x]+=2; } cir(i,0,len-3){ for(auto&x:crsap[{a[i],a[i+1],a[i+2],a[i+3]}]) prob[x]+=4; } cir(i,0,len-4){ for(auto&x:crsap[{a[i],a[i+1],a[i+2],a[i+3],a[i+4]}]) prob[x]+=8; } pair<int,int> hx={-1,-1}; for(auto&[ax,bx]:prob) hx=max(hx,{bx,-ax}); const auto ql=language(-hx.second); cir(i,0,len-1){ crsap[{a[i],a[i+1]}].insert(ql); } cir(i,0,len-2){ crsap[{a[i],a[i+1],a[i+2]}].insert(ql); } cir(i,0,len-3){ crsap[{a[i],a[i+1],a[i+2],a[i+3]}].insert(ql); } cir(i,0,len-4){ crsap[{a[i],a[i+1],a[i+2],a[i+3],a[i+4]}].insert(ql); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...