# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
512761 | Markomafko972 | Languages (IOI10_languages) | C++14 | 5388 ms | 97620 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 <stdlib.h>
#include <stdio.h>
#include "grader.h"
#include "lang.h"
using namespace std;
map<int, long long> m[60];
set<int> s;
vector<int> v;
void excerpt(int *E) {
s.clear();
v.clear();
for (int i = 0; i < 100; i++) s.insert(E[i]);
for (set<int> :: iterator it = s.begin(); it != s.end(); it++) v.push_back(*it);
int maxi = -1, koji = 0;
for (int i = 0; i < 56; i++) {
int kol = 0;
for (int j = 0; j < v.size(); j++) {
if (m[i][v[j]] > 0) kol++;
if (j > 0 && m[i][(long long)65535*(long long)v[j-1]+(long long)v[j]] > 0) kol+=5;
//if (j > 1 && m[i][(long long)65535*(long long)65535*(long long)v[j-2]+(long long)65535*(long long)v[j-1]+(long long)v[j]]) kol++;
}
if (kol > maxi) {
maxi = kol;
koji = i;
}
}
int pravi = language(koji);
for (int i = 0; i < v.size(); i++) {
m[pravi][v[i]]++;
if (i > 0) m[pravi][(long long)65535*(long long)v[i-1]+(long long)v[i]]++;
//if (i > 1) m[pravi][(long long)65535*(long long)65535*(long long)v[i-2]+(long long)65535*(long long)v[i-1]+(long long)v[i]]++;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |