Submission #654802

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
654802	2022-11-01 16:33:10	NeroZein	Palindromes (APIO14_palindrome)	C++14	100 / 100	26 ms	35208 KiB

palindrome

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5+10; 
string s;
int num,suff; 
struct node{
    int next[26];
    int len,num,sufflink;
}tree[N]; 
inline void ini(){
    num = suff = 2; 
    tree[1].len = -1;tree[1].sufflink = 1; 
    tree[2].len =  0;tree[2].sufflink = 1; 
}
inline void add(int pos){
    int cur = suff, curlen = 0; 
    int let = s[pos]-'a'; 
    while (true){
        curlen = tree[cur].len;
        if (pos-1-curlen >= 0 && s[pos-1-curlen] == s[pos])
            break; 
        cur = tree[cur].sufflink;
    }
    if (tree[cur].next[let]){
        suff = tree[cur].next[let]; 
        tree[tree[cur].next[let]].num++; 
        return; 
    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 15 / 15
• Subtask 3: 24 / 24
• Subtask 4: 26 / 26
• Subtask 5: 27 / 27