Submission #252318

#TimeUsernameProblemLanguageResultExecution timeMemory
252318SamAndLanguages (IOI10_languages)C++17
56 / 100
2151 ms6432 KiB
#include <bits/stdc++.h> #include "grader.h" #include "lang.h" using namespace std; const int N = 56; const int m = 100; set<int> s[N]; void excerpt(int *E) { int maxu = -1, maxi = -1; for (int i = 0; i < N; ++i) { int q = 0; for (int j = 0; j < m; ++j) { if (s[i].find(E[j]) != s[i].end()) ++q; } if (q > maxu) { maxu = q; maxi = i; } } int u = language(maxi); for (int j = 0; j < m; ++j) s[u].insert(E[j]); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...