# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
525994 | tkwiatkowski | 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.
/*
Zadanie:
Autor: Tomasz Kwiatkowski
*/
#include <bits/stdc++.h>
#include "lang.h"
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
const int MAXN = 1e6 + 7;
const int INF = 1e9 + 7;
map<ll, int> lang[56];
int excerpt(int E[100])
{
vector<int> best(56, 0);
for (int i = 1; i < 100; ++i) {
ll p = (E[i - 1] - 1)*65535 + E[i] - 1;
for (int l = 0; l < 56; ++l)
best[l] += lang[l][p];
}
int guess = 0;
for (int i = 1; i < 56; ++i)
if (best[i] > best[guess])
guess = i;
int L = language(guess);
for (int i = 1; i < 100; ++i) {
ll p = (E[i - 1] - 1)*65535 + E[i] - 1;
lang[L][p]++;
}
}