oj.uz

Submission #156012

# Submission time Handle Problem Language Result Execution time Memory
156012 2019-10-02T14:58:55 Z xennygrimmato Palindromes (APIO14_palindrome) C++17
100 / 100
 103 ms 40584 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
 
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 100001;
const int MAXN = 300002;
 
// Credit: benq's Palindromic Tree template

template<int SZ> struct palTree {
    static const int sigma = 26;
 
    int s[SZ], len[SZ], link[SZ], to[SZ][sigma], oc[SZ];
     
    int n, last, sz;
     
    palTree() {
        s[n++] = -1;
        link[0] = 1;
        len[1] = -1;
        sz = 2;
    }
     
    int get_link(int v) {
        while(s[n-len[v]-2] != s[n-1]) v = link[v];
        return v;
    }
     
    void add_letter(int c) {
        s[n++] = c;
        last = get_link(last);
        if (!to[last][c]) {
            len[sz] = len[last]+2;
            link[sz] = to[get_link(link[last])][c];
            to[last][c] = sz++;
        }
        last = to[last][c];
        oc[last] ++;
    }
    
    void prop() {
        vpi v;
        FOR(i,2,sz) v.pb({len[i],i});
        sort(all(v)); reverse(all(v));
        for (auto a: v) oc[link[a.s]] += oc[a.s]; 
    }
};

palTree<MAXN> p;

int main() {
    string s; cin >> s;
    for(char c: s) p.add_letter(c - 'a');
    p.prop();
    ll ret = 0;
    FOR(i, 2, p.sz) ret = max(ret, (ll)p.len[i] * p.oc[i]);
    cout << ret;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1704 KB Output is correct
2 Correct 5 ms 1784 KB Output is correct
3 Correct 5 ms 1784 KB Output is correct
4 Correct 5 ms 1784 KB Output is correct
5 Correct 5 ms 1788 KB Output is correct
6 Correct 5 ms 1784 KB Output is correct
7 Correct 5 ms 1784 KB Output is correct
8 Correct 3 ms 380 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 5 ms 1272 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 13424 KB Output is correct
2 Correct 30 ms 13500 KB Output is correct
3 Correct 27 ms 13424 KB Output is correct
4 Correct 33 ms 13552 KB Output is correct
5 Correct 33 ms 13548 KB Output is correct
6 Correct 26 ms 10408 KB Output is correct
7 Correct 29 ms 11756 KB Output is correct
8 Correct 10 ms 1116 KB Output is correct
9 Correct 9 ms 4088 KB Output is correct
10 Correct 29 ms 11760 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 40256 KB Output is correct
2 Correct 93 ms 40580 KB Output is correct
3 Correct 78 ms 40584 KB Output is correct
4 Correct 100 ms 40580 KB Output is correct
5 Correct 103 ms 40584 KB Output is correct
6 Correct 87 ms 36744 KB Output is correct
7 Correct 84 ms 32940 KB Output is correct
8 Correct 25 ms 2452 KB Output is correct
9 Correct 25 ms 2452 KB Output is correct
10 Correct 84 ms 32268 KB Output is correct
11 Correct 77 ms 40456 KB Output is correct
12 Correct 30 ms 5844 KB Output is correct