# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
561529 | maximath_1 | Palindromes (APIO14_palindrome) | C++11 | 69 ms | 61140 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 <iostream>
#include <vector>
using namespace std;
#define ll long long
const int MX = 3e5 + 5;
struct palindromic_tree{
struct node{
int nxt[26], suff_link, len, cnt;
vector<int> edges;
} tree[MX];
string s;
int suff, num;
void add_letter(int pos){
int cr = suff;
int cr_len = 0;
int letter = s[pos] - 'a';
for(;;){
cr_len = tree[cr].len;
if(pos - 1 - cr_len >= 0 && s[pos - 1 - cr_len] == s[pos])
break;
cr = tree[cr].suff_link;
}
if(tree[cr].nxt[letter]){
suff = tree[cr].nxt[letter];
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |