oj.uz

Submission #305595

# Submission time Handle Problem Language Result Execution time Memory
305595 2020-09-23T16:15:29 Z MarcoMeijer Palindromes (APIO14_palindrome) C++14
100 / 100
 107 ms 94976 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5;

int n;

struct Node {
    int nxt[26], sufflink, len;
    int cnt=1;
    vi adj;
} tree[MX];

string s;
int suf, num;

void initTree() {
    num = suf = 2;
    tree[1].len = -1; tree[1].sufflink = 1;
    tree[2].len =  0; tree[2].sufflink = 1;
    tree[1].adj.pb(2);
}
void addLetter(int pos) {
    int cur = suf, curLen = 0;
    int letter = s[pos]-'a';

    while(1) {
        curLen = tree[cur].len;
        if(pos-1-curLen >= 0 && s[pos-1-curLen] == s[pos])
            break;
        cur = tree[cur].sufflink;
    }
    if(tree[cur].nxt[letter]) {
        suf = tree[cur].nxt[letter];
        tree[suf].cnt++;
        return;
    }

    suf = ++num;
    tree[num].len = tree[cur].len+2;
    tree[cur].nxt[letter] = suf;

    if(tree[num].len == 1) {
        tree[num].sufflink = 2;
        tree[2].adj.pb(num);
        return;
    }

    while(1) {
        cur = tree[cur].sufflink;
        curLen = tree[cur].len;
        if(pos-1-curLen >= 0 && s[pos-1-curLen] == s[pos]) {
            tree[num].sufflink = tree[cur].nxt[letter];
            tree[tree[cur].nxt[letter]].adj.pb(num);
            break;
        }
    }
}

ll ans = 0;
void dfs(int u=1) {
    FOR(v, tree[u].adj) {
        dfs(v);
        tree[u].cnt += tree[v].cnt;
    }
    ans = max(ans, (ll)tree[u].cnt*(ll)tree[u].len);
}

void program() {
    IN(s); n=s.sz;
    initTree();
    RE(i,n) addLetter(i);
    dfs();
    OUTL(ans);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 70776 KB Output is correct
2 Correct 43 ms 70776 KB Output is correct
3 Correct 44 ms 70784 KB Output is correct
4 Correct 44 ms 70776 KB Output is correct
5 Correct 44 ms 70776 KB Output is correct
6 Correct 43 ms 70776 KB Output is correct
7 Correct 43 ms 70784 KB Output is correct
8 Correct 44 ms 70776 KB Output is correct
9 Correct 43 ms 70784 KB Output is correct
10 Correct 43 ms 70776 KB Output is correct
11 Correct 43 ms 70776 KB Output is correct
12 Correct 44 ms 70776 KB Output is correct
13 Correct 43 ms 70784 KB Output is correct
14 Correct 45 ms 70776 KB Output is correct
15 Correct 44 ms 70776 KB Output is correct
16 Correct 44 ms 70776 KB Output is correct
17 Correct 44 ms 70784 KB Output is correct
18 Correct 44 ms 70776 KB Output is correct
19 Correct 43 ms 70780 KB Output is correct
20 Correct 43 ms 70776 KB Output is correct
21 Correct 43 ms 70776 KB Output is correct
22 Correct 45 ms 70904 KB Output is correct
23 Correct 43 ms 70776 KB Output is correct
24 Correct 44 ms 70784 KB Output is correct
25 Correct 44 ms 70776 KB Output is correct
26 Correct 43 ms 70784 KB Output is correct
27 Correct 46 ms 70776 KB Output is correct
28 Correct 45 ms 70776 KB Output is correct
29 Correct 45 ms 70776 KB Output is correct
30 Correct 43 ms 70776 KB Output is correct
31 Correct 43 ms 70796 KB Output is correct
32 Correct 45 ms 70784 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 70780 KB Output is correct
2 Correct 44 ms 70776 KB Output is correct
3 Correct 45 ms 70904 KB Output is correct
4 Correct 45 ms 70776 KB Output is correct
5 Correct 43 ms 70912 KB Output is correct
6 Correct 43 ms 70904 KB Output is correct
7 Correct 43 ms 70784 KB Output is correct
8 Correct 44 ms 70776 KB Output is correct
9 Correct 43 ms 70776 KB Output is correct
10 Correct 44 ms 70796 KB Output is correct
11 Correct 43 ms 70776 KB Output is correct
12 Correct 46 ms 70764 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 71288 KB Output is correct
2 Correct 44 ms 71288 KB Output is correct
3 Correct 49 ms 71544 KB Output is correct
4 Correct 46 ms 71560 KB Output is correct
5 Correct 49 ms 71040 KB Output is correct
6 Correct 45 ms 71032 KB Output is correct
7 Correct 45 ms 71168 KB Output is correct
8 Correct 49 ms 70776 KB Output is correct
9 Correct 44 ms 70776 KB Output is correct
10 Correct 46 ms 70904 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 61 ms 76408 KB Output is correct
2 Correct 57 ms 75416 KB Output is correct
3 Correct 59 ms 78840 KB Output is correct
4 Correct 57 ms 77048 KB Output is correct
5 Correct 65 ms 72184 KB Output is correct
6 Correct 55 ms 72952 KB Output is correct
7 Correct 56 ms 74060 KB Output is correct
8 Correct 47 ms 71068 KB Output is correct
9 Correct 49 ms 72700 KB Output is correct
10 Correct 59 ms 71928 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 87808 KB Output is correct
2 Correct 88 ms 82816 KB Output is correct
3 Correct 85 ms 94976 KB Output is correct
4 Correct 82 ms 85888 KB Output is correct
5 Correct 107 ms 75776 KB Output is correct
6 Correct 79 ms 81536 KB Output is correct
7 Correct 79 ms 79872 KB Output is correct
8 Correct 50 ms 71680 KB Output is correct
9 Correct 51 ms 71808 KB Output is correct
10 Correct 96 ms 74880 KB Output is correct
11 Correct 85 ms 83072 KB Output is correct
12 Correct 53 ms 73472 KB Output is correct