#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
#define SZ 100
using namespace std;
int ant[60][110];
int lang[10010];
int vez;
void excerpt(int *E)
{
map<int, bool> aparece;
for (int i = 1; i <= 100; i++)
aparece[E[i-1]] = 1;
int opt = 1;
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];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4527 ms |
416 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
4620 ms |
384 KB |
Output is partially correct - 37.51% |