Submission #197988

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
1979882020-01-24 12:41:30model_codeLampice (COCI19_lampice)C++17
73 / 110
5052 ms6008 KiB
#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)
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...