This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdlib.h>
#include <stdio.h>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
#include "grader.h"
#include "lang.h"
#define SZ 100
set<int> S[56];
int L = 56;
void excerpt(int *E) {
set<int> sample(E, E+100);
int best_score = 0;
int best_guess = 0;
for (int i=0;i<L;i++){
set<int> intersect;
set_intersection(sample.begin(), sample.end(), S[i].begin(), S[i].end(),
std::inserter(intersect, intersect.begin()));
int score = intersect.size();
if (best_score < score){
best_score = score;
best_guess = i;
}
}
int target = language(best_guess);
S[target].insert(sample.begin(), sample.end());
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |