제출 #201789

#제출 시각아이디문제언어결과실행 시간메모리
201789luciocfLanguages (IOI10_languages)C++14
56 / 100
3813 ms11572 KiB
#include <bits/stdc++.h> #include "grader.h" #include "lang.h" using namespace std; map<int, bool> ant[60]; void excerpt(int *E) { int opt = 0; int mx_ig = 0; for (int i = 0; i <= 55; i++) { set<int> dist; for (int j = 1; j <= 100; j++) if (E[j-1] >= 'A' && ant[i][E[j-1]]) dist.insert(E[j-1]); if ((int)dist.size() > mx_ig) opt = i, mx_ig = (int)dist.size(); } int x = language(opt); for (int i = 1; i <= 100; i++) ant[x][E[i-1]] = 1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...