Submission #201780

#TimeUsernameProblemLanguageResultExecution timeMemory
201780luciocfLanguages (IOI10_languages)C++14
39 / 100
4582 ms512 KiB
#include <bits/stdc++.h> #include "grader.h" #include "lang.h" using namespace std; int ant[60][110]; void excerpt(int *E) { map<int, int> aparece; aparece.clear(); for (int i = 1; i <= 100; i++) aparece[E[i-1]] = 1; 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 (aparece[ant[i][j]]) dist.insert(ant[i][j]); 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][i] = E[i-1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...