Submission #699595

#TimeUsernameProblemLanguageResultExecution timeMemory
699595qwerasdfzxclLanguages (IOI10_languages)C++17
56 / 100
1796 ms6452 KiB
#include "grader.h" #include "lang.h" #include <bits/stdc++.h> typedef long long ll; using namespace std; set<int> st[101]; void push(int *E, int typ){ for (int i=0;i<100;i++) st[typ].insert(E[i]); } int calc(int *E, int typ){ int ret = 0; for (int i=0;i<100;i++) if (st[typ].find(E[i])==st[typ].end()) ret++; return ret; } void excerpt(int *E){ int mn = 1e9, idx = -1; for (int i=0;i<56;i++){ int score = calc(E, i); if (score < mn){ mn = score; idx = i; } } push(E, language(idx)); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...