oj.uz

Submission #57081

# Submission time Handle Problem Language Result Execution time Memory
57081 2018-07-13T20:26:04 Z Benq Palindromes (APIO14_palindrome) C++14
100 / 100
 104 ms 45772 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;

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];
        // cout << "OH " << len[last] << " " << last << " " << n << "\n";
        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<300010> p;

string s;

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

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
*/

Subtask #1
8.0 / 8.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1124 KB Output is correct
2 Correct 3 ms 1128 KB Output is correct
3 Correct 3 ms 1128 KB Output is correct
4 Correct 3 ms 1136 KB Output is correct
5 Correct 2 ms 1140 KB Output is correct
6 Correct 2 ms 1144 KB Output is correct
7 Correct 3 ms 1148 KB Output is correct
8 Correct 4 ms 1276 KB Output is correct
9 Correct 3 ms 1276 KB Output is correct
10 Correct 3 ms 1276 KB Output is correct
11 Correct 3 ms 1276 KB Output is correct
12 Correct 3 ms 1276 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 2580 KB Output is correct
2 Correct 4 ms 2608 KB Output is correct
3 Correct 5 ms 2636 KB Output is correct
4 Correct 5 ms 2648 KB Output is correct
5 Correct 6 ms 2676 KB Output is correct
6 Correct 5 ms 2676 KB Output is correct
7 Correct 7 ms 2676 KB Output is correct
8 Correct 12 ms 2676 KB Output is correct
9 Correct 3 ms 2676 KB Output is correct
10 Correct 4 ms 2676 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 14728 KB Output is correct
2 Correct 36 ms 14836 KB Output is correct
3 Correct 26 ms 14868 KB Output is correct
4 Correct 30 ms 15032 KB Output is correct
5 Correct 34 ms 15136 KB Output is correct
6 Correct 20 ms 15136 KB Output is correct
7 Correct 28 ms 15136 KB Output is correct
8 Correct 5 ms 15136 KB Output is correct
9 Correct 11 ms 15136 KB Output is correct
10 Correct 30 ms 15136 KB Output is correct

Subtask #5
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 42840 KB Output is correct
2 Correct 97 ms 43120 KB Output is correct
3 Correct 66 ms 43432 KB Output is correct
4 Correct 104 ms 43728 KB Output is correct
5 Correct 78 ms 44148 KB Output is correct
6 Correct 67 ms 44148 KB Output is correct
7 Correct 64 ms 44148 KB Output is correct
8 Correct 9 ms 44148 KB Output is correct
9 Correct 10 ms 44148 KB Output is correct
10 Correct 75 ms 44148 KB Output is correct
11 Correct 58 ms 45772 KB Output is correct
12 Correct 16 ms 45772 KB Output is correct