제출 #44986

#제출 시각아이디문제언어결과실행 시간메모리
44986junodeveloperLanguages (IOI10_languages)C++14
0 / 100
1105 ms262148 KiB
#include "lang.h" #include "grader.h" #include <map> #include <algorithm> using namespace std; typedef unsigned long long ll; map<ll, int> mp[56]; void excerpt(int* a) { int cnt[56] = {0}; for(int i=0; i<96; i++) { ll val = 0; for(int j=0; j<4; j++) val = val * 65535 + a[i+j] - 1; int mx = 0, idx = 0; for(int j=0; j<56; j++) if(mx < mp[j][val]) mx = mp[j][val], idx = j; cnt[idx]++; } int ret = max_element(cnt, cnt+56) - cnt; int ans = language(ret); for(int i=0; i<96; i++) { ll val = 0; for(int j=0; j<4; j++) val = val * 65535 + a[i+j] - 1; mp[ans][val]++; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...