#include <bits/stdc++.h>
using namespace std;
#include "grader.h"
#include "lang.h"
typedef unsigned long long u64;
static const int mod = 666013;
static const int nmax = 100;
static const int lgmax = 4;
static const int nrlang = 56;
static const int base = 218279;
bool viz[nrlang];
int c[nmax + 1];
u64 hp[nmax + 1][nmax + 1];
vector<u64> h[mod];
void baga (int l, u64 x) {
int key = (x * 61 + l) % mod;
for (auto i : h[key])
if (i == x)
return ;
h[key].push_back(x);
}
bool cauta (int l, u64 x) {
int key = (x * 61 + l) % mod;
for (auto i : h[key])
if (i == x)
return 1;
return 0;
}
void excerpt(int *E) {
int bstcost = -1, bstlang = 0;
for (int i = 1; i <= nmax; ++ i) {
for (int j = i; j <= i + lgmax; ++ j) {
hp[i][j] = hp[i][j - 1] * base + E[j - 1];
}
}
for (int l = 0; l < nrlang; ++ l) {
if (viz[l] == 0)
continue;
c[0] = 0;
for (int i = 1; i <= nmax; ++ i) {
c[i] = 0;
for (int j = max(0, i - lgmax); j < i; ++ j) {
c[i] = max(c[i], c[j] + cauta(l, hp[j + 1][i]) * (i - j) * (i - j));
}
}
if (c[nmax] > bstcost) {
bstcost = c[nmax];
bstlang = l;
}
}
int ans = language(bstlang);
viz[ans] = 1;
for (int i = 1; i <= nmax; ++ i) {
u64 hsh = 0;
for (int j = max(0, i - lgmax); j < i; ++ j) {
baga(ans, hp[j + 1][i]);
}
}
}
Compilation message
lang.cpp: In function 'void excerpt(int*)':
lang.cpp:69:13: warning: unused variable 'hsh' [-Wunused-variable]
u64 hsh = 0;
^~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8312 ms |
33724 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
8464 ms |
33660 KB |
Output is partially correct - 88.28% |