제출 #44988

#제출 시각아이디문제언어결과실행 시간메모리
44988junodeveloperLanguages (IOI10_languages)C++14
0 / 100
1262 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]; ll cnt[56] = {0}; void excerpt(int* a) { for(int i=0; i<56; i++) cnt[i] = 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; for(int j=0; j<56; j++) cnt[j] += mp[j][val]; } 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...