제출 #359329

#제출 시각아이디문제언어결과실행 시간메모리
359329mohamedsobhi777Languages (IOI10_languages)C++14
66 / 100
567 ms9548 KiB
#include <bits/stdc++.h> #include "lang.h" #include "grader.h" using namespace std; const int Lang = 56; int lang[Lang + 1][66000]; int reef[Lang + 1][66000]; int *glo; int freq[66000]; set<int> sit[66000]; long long calc(int lan) { for (int i = 0; i < 100; ++i) freq[glo[i]] = 0; long long ret = 0; for (int i = 0; i < 100; ++i) { if (int(sit[glo[i]].size()) > 45) continue; if (reef[lan][glo[i]] < 3) continue; ret += ++freq[glo[i]] * lang[lan][glo[i]]; } return ret; } void excerpt(int *ex) { glo = ex; long long simi = 0; int wnr = 0; for (int i = 0; i < Lang; ++i) { double y = calc(i); if (y > simi) { simi = y; wnr = i; } } srand(time(0)); int z = language(wnr); for (int i = 0; i < 100; ++i) { // lang[z][ex[i]]++; lang[z][ex[i]] = min(lang[z][ex[i]] + rand() % 2 + 1, 30); reef[z][ex[i]]++; sit[ex[i]].insert(z); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...