Submission #131305

#TimeUsernameProblemLanguageResultExecution timeMemory
131305dragonslayeritLanguages (IOI10_languages)C++14
96 / 100
5782 ms12296 KiB
#include <stdlib.h> #include <stdio.h> #include <set> #include <map> #include <algorithm> #include <stdint.h> #include <unordered_set> #include "grader.h" #include "lang.h" #define SZ 100 std::unordered_set<uint64_t> had[56]; void excerpt(int *E) { std::set<int> distinct; for(int i=0;i<100-2;i++){ distinct.insert(uint64_t(E[i])<<24|uint64_t(E[i+1])<<16|uint64_t(E[i+2])); } int sim[56]={}; for(int l=0;l<56;l++){ for(int c:distinct){ sim[l]+=had[l].count(c); } } int guess=std::max_element(sim,sim+56)-sim; int ans=language(guess); for(int c:distinct){ had[ans].insert(c); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...