제출 #512729

#제출 시각아이디문제언어결과실행 시간메모리
512729lovro_nidogon1Languages (IOI10_languages)C++14
56 / 100
348 ms4444 KiB
#include<bits/stdc++.h> #define ll long long #include "lang.h" #include "grader.h" using namespace std; ll freq[56][70001], nocur[56], spac, cfreq[70001]; ll sq(ll x, ll y) {return (x - y) * (x - y);} void excerpt(int *e) { memset(cfreq, 0, sizeof(cfreq)); for(ll i = 0; i < 100; i++) cfreq[e[i]]=1; ll exp = 0; ll sd = 0; for(ll i = 0; i < 56; i++) { ll csd = 0; for(ll j = 0; j < 100; j++) csd += freq[i][e[j]]; if(csd > sd) sd = csd, exp = i; } ll ca = language(exp); for(ll i = 0; i < 100; i++) freq[ca][e[i]] = 1; nocur[ca]++; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...