#include <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
#define SZ 100
using namespace std;
int ant[1100000];
int lang[10010];
int vez;
void excerpt(int *E)
{
map<int, bool> aparece;
++vez;
if (vez == 1)
{
lang[vez] = language(1);
return;
}
for (int i = 1; i <= 100; i++)
{
ant[(vez-1)*100 + i] = E[i-1];
aparece[E[i-1]] = 1;
}
int opt = 1;
int mx_ig = 0;
for (int i = 0; i < vez-1; i++)
{
set<int> dist;
for (int j = 1; j <= 100; j++)
if (aparece[ant[i*100 + j]])
dist.insert(ant[i*100 + j]);
if ((int)dist.size() > mx_ig)
opt = lang[i+1], mx_ig = (int)dist.size();
}
lang[vez] = language(opt);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
10024 ms |
1592 KB |
Time limit exceeded |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
10089 ms |
1140 KB |
Time limit exceeded |