제출 #512740

#제출 시각아이디문제언어결과실행 시간메모리
512740lovro_nidogon1Languages (IOI10_languages)C++14
90 / 100
5697 ms14316 KiB
#include<bits/stdc++.h> #include "lang.h" #include "grader.h" using namespace std; int freq[56][70001], nocur[56], spac, cfreq[70001]; const int cum = 5; set<pair<int, int> > ses[56]; set<pair<int, pair<int, int> > > sussy[56]; void excerpt(int *e) { int exp = 0; int sd = 0; for(int i = 0; i < 56; i++) { int csd = 0; for(int j = 0; j < 100; j++) csd += freq[i][e[j]]; for(int j = 0; j < 99; j++) csd += (ses[i].find({e[j], e[j + 1]}) != ses[i].end()); for(int j = 0; j < 98; j+=cum) csd += (sussy[i].find({e[j], {e[j + 1], e[j + 2]}}) != sussy[i].end()); if(csd > sd) sd = csd, exp = i; } int ca = language(exp); for(int i = 0; i < 100; i++) freq[ca][e[i]] = 1; for(int i = 0; i < 99; i++) ses[ca].insert({e[i], e[i + 1]}); for(int i = 0; i < 98; i+=cum) sussy[ca].insert({e[i], {e[i + 1], e[i + 2]}}); nocur[ca]++; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...