# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197988 | model_code | Lampice (COCI19_lampice) | C++17 | 5052 ms | 6008 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>
using namespace std;
const int MAXN = 50010;
int n;
char input[MAXN];
vector<int> adj[MAXN];
int stk_sz = 1;
char stk[2 * MAXN];
int pivot = 0;
int ans = 1;
int manacher() {
static int rad[2 * MAXN];
int x = 0;
for (int i = 1; i < stk_sz; ++i) {
int &r = rad[i] = 0;
if (i <= x + rad[x])
r = min(rad[2 * x - i], x + rad[x] - i);
while (i - r - 1 >= 0 && i + r + 1 < stk_sz &&
stk[i - r - 1] == stk[i + r + 1]) ++r;
if (i + r >= x + rad[x]) x = i;
}
int ret = 0;
for (int i = 0; i < stk_sz; ++i)
if (rad[i] > ret)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |