# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
511395 | 600Mihnea | Languages (IOI10_languages) | C++17 | 0 ms | 0 KiB |
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 <bits/stdc++.h>
#include "grader.h"
#include "lang.h"
using namespace std;
const int N = 100;
const int L = 56;
const int LIMIT = 3;
set<int> words[L];
int score[L];
void excerpt(int *a) {
for (int i = 0; i < N; i++) {
ll current = 0;
for (int len = 1; i + len - 1 < N && len <= LIMIT; len++) {
current *= 111111111;
current += a[i + len - 1];
for (int l = 0; l < L; l++) {
score[l] += words[l].count(current);
}
}
}
int highest = -1, prediction = -1;
for (int l = 0; l < L; l++) {
if (score[l] > highest) {
highest = score[l];
prediction = l;
}
score[l] = 0;
}
int solution = language(prediction);
for (int i = 0; i < N; i++) {
ll current = 0;
for (int len = 1; i + len - 1 < N && len <= LIMIT; len++) {
current *= 111111111;
current += a[i + len - 1];
words[solution].insert(current);
}
}
}