# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
170181 | ics0503 | Languages (IOI10_languages) | C++17 | 10116 ms | 198456 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 <stdlib.h>
#include <stdio.h>
#include <map>
using namespace std;
#include "grader.h"
#include "lang.h"
#define SZ 100
int num[56][65536], ccnt = 0, commonChar[65536], uniqueChar[65536];
int mod = 499973;
map<long long, int> num2[56], num3[56];
long long hash2(long long x, long long y) {
return x * 65536 + y;
}
long long hash3(long long x, long long y, long long z) {
return (((x * 65536 + y) )*65536 + z);
}
int pandan(int *E) {
int nE[222] = { 0, }, n=0, i, j;
for (i = 0; i < 100; i++) if (uniqueChar[E[i]] != -1) return uniqueChar[E[i]];
int js[56] = { 0, };
for (i = 1; i < 100; i++) {
long long g = hash2(E[i - 1], E[i]);
for (j = 0; j < 56; j++) {
js[j] += num2[j][g];
}
}
for (i = 2; i < 100; i++) {
long long g = hash3(E[i-2], E[i - 1], E[i]);
for (j = 0; j < 56; j++) {
js[j] += num3[j][g]*3;
}
}
int mx = -1, mxw = 0;
for (i = 0; i < 56; i++) if (mx < js[i])mx = js[i], mxw = i;
return mxw;
}
void learn(int *E, int ans) {
int i, j, k;
for (i = 0; i < 100; i++) num[ans][E[i]] = 1;
for (i = 1; i < 100; i++) num2[ans][hash2(E[i - 1], E[i])] = 1;
for (i = 2; i < 100; i++) num3[ans][hash3(E[i - 2], E[i - 1], E[i])] = 1;
for (i = 0; i < 100; i++) {
int cr = E[i];
int cnt = 0, w = -1;
for (j = 0; j < 56; j++) {
if (num[j][cr]) {
cnt++;
w = j;
}
}
commonChar[cr] = cnt>20?1:0;
uniqueChar[cr] = cnt==1?w:-1;
}
}
void excerpt(int *E) {
int i, j;
ccnt++;
int ans = language(pandan(E));
learn(E, ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |