# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522204 | sean617 | Languages (IOI10_languages) | C++98 | 3173 ms | 8528 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 "grader.h"
#include "lang.h"
//#include <unordered_map>
//#include <vector>
//#include <cstring>
#include <algorithm>
#include <set>
using namespace std;
typedef long long ll;
ll l, M = (1 << 16), e[10005], v[58][100000];
set<ll> v2[58];
void excerpt(int *E) {
ll i, j, t, num, ans = 0, x, mx = 0, mx2 = 0, cnt, cnt2;
l = 100;
for (i = 0; i < l; i++) e[i] = E[i];
//sort(E, E + l);
for (x =0; x < 56; x++) {
cnt = 0;
cnt2 =0;
for (i =1; i < l; i++) {
t = e[i - 1] * M + e[i];
if (v2[x].count(t) == 1) cnt++;
cnt2 += v[x][e[i]];
}
if (cnt > mx || cnt == mx && cnt2 > mx2) {
mx = cnt;
mx2 = cnt2;
ans = x;
}
}
ans = language(ans);
for (i = 1; i < l; i++) {
t = e[i - 1] * M + e[i];
v2[ans].insert(t);
v[ans][e[i]] = 1;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |