oj.uz

Submission #926518

# Submission time Handle Problem Language Result Execution time Memory
926518 2024-02-13T07:59:50 Z vjudge1 Palindromes (APIO14_palindrome) C++17
0 / 100
 26 ms 70904 KB 
#include<bits/stdc++.h>
#define N 300100
using namespace std;
long long S[N],ans,c;
struct T {
    long long t[N][26],li[N],len[N],oc[N],sz,lst;
    T(){sz=li[0]=li[1]=1;len[1]=-1;}
    void add(int c) {
        int p = lst;S[sz]=c;
        while (S[sz-1-len[p]]-c)p=li[p];
        if (!t[p][c]) {
            int q=li[p];
            while(S[sz-len[q]-1]-c)q=li[q];
            li[++sz]=t[q][c];
            len[t[p][c]=sz]=len[p]+2;
        }
        oc[lst=t[p][c]]++;
    }
} X; 
int main() {
    memset(S,1,sizeof S);
    c=getchar();
    while(c!='\n') X.add(c-'a'),c=getchar();
    for(int x=X.sz;~x;x--)
        X.oc[X.li[x]]+=X.oc[x];
    for(int x=X.sz;~x;x--)
        ans=max(ans,X.len[x]*X.oc[x]);
    cout<<ans<<'\n';
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9048 KB Output is correct
2 Correct 1 ms 9048 KB Output is correct
3 Correct 1 ms 9052 KB Output is correct
4 Correct 1 ms 9052 KB Output is correct
5 Correct 1 ms 9052 KB Output is correct
6 Correct 1 ms 9052 KB Output is correct
7 Correct 1 ms 9052 KB Output is correct
8 Correct 1 ms 9144 KB Output is correct
9 Correct 1 ms 9052 KB Output is correct
10 Correct 1 ms 9052 KB Output is correct
11 Incorrect 1 ms 9168 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 9308 KB Output is correct
2 Correct 1 ms 9308 KB Output is correct
3 Correct 2 ms 9308 KB Output is correct
4 Correct 1 ms 9052 KB Output is correct
5 Correct 1 ms 9168 KB Output is correct
6 Correct 2 ms 9308 KB Output is correct
7 Correct 1 ms 9164 KB Output is correct
8 Correct 1 ms 9308 KB Output is correct
9 Correct 1 ms 9052 KB Output is correct
10 Incorrect 1 ms 9052 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 13148 KB Output is correct
2 Correct 2 ms 13148 KB Output is correct
3 Correct 3 ms 13144 KB Output is correct
4 Correct 3 ms 13144 KB Output is correct
5 Correct 3 ms 13148 KB Output is correct
6 Incorrect 2 ms 10712 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 31324 KB Output is correct
2 Correct 11 ms 31536 KB Output is correct
3 Correct 10 ms 31568 KB Output is correct
4 Correct 12 ms 31580 KB Output is correct
5 Correct 14 ms 31580 KB Output is correct
6 Incorrect 5 ms 16732 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 70904 KB Output is correct
2 Incorrect 19 ms 49556 KB Output isn't correct
3 Halted 0 ms 0 KB -