oj.uz

Submission #46686

# Submission time Handle Problem Language Result Execution time Memory
46686 2018-04-22T14:57:54 Z ngkan146 Palindromes (APIO14_palindrome) C++11
73 / 100
 1000 ms 48260 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = (ll) 1e9+9;
const ll base = 29;
int lg2[300005];
// remember to run this
void prepLg2(int bound){
    for(int i=2;i<=bound;i++)
        lg2[i] = lg2[i>>1] + 1;
}
struct suffixArray{
    vector <int> sa, saRank, tmp;
    vector <vector <int> > lcp;
    int strLen, gap;

    bool saCmp(int x,int y){
        if (saRank[x] != saRank[y])
            return saRank[x] < saRank[y];
        return x+gap < strLen && y+gap < strLen ? saRank[x+gap] < saRank[y+gap] : x > y;
    }

    void build_lcp(string &s){
        int k = 0;
        for(int i = 0; i < strLen; i ++){
            if (saRank[i] != strLen - 1){
                for (int j = sa[saRank[i] + 1]; max(i+k, j+k) < strLen && s[i + k] == s[j + k];)  ++k;
                lcp[saRank[i]][0] = k;
                if (k) k--;
            }
        }
        for(int k = 1; k < 20; k ++){
            for(int i = 0; i < strLen; i ++)
                if (i + (1<<k) < strLen)
                    lcp[i][k] = min(lcp[i][k-1], lcp[i+(1<<(k-1))][k-1]);
                else break;
        }
    }

    int getLcp(int l,int r){
        if (l > r)  swap(l, r);
        if (l == r) return strLen - sa[l];
        int k = lg2[r - l];
        return min(lcp[l][k], lcp[r-(1<<k)][k]);
    }

    void build(string &s, int isIndexFromOne = 0){
        strLen = s.size();
        sa.assign(strLen + 5, 0);
        saRank.assign(strLen + 5, 0);
        tmp.assign(strLen + 5, 0);
        lcp.assign(strLen + 5, vector<int>(20));
        //for(int i = 0; i < strLen; i ++)
        //    lcp[i].assign(20, 0);

        for(int i = 0; i < strLen; i ++)
            sa[i] = i, saRank[i] = s[i];

        for(gap = 1;;gap *= 2){
            sort(sa.begin(), sa.begin() + strLen, [&](int a, int b) {return this->saCmp(a, b);});
            //sort(sa.begin(), sa.begin() + strLen, saCmp);
            for(int i = 0; i < strLen; i ++) tmp[i+1] = tmp[i] + saCmp(sa[i], sa[i+1]);
            for(int i = 0; i < strLen; i ++) saRank[sa[i]] = tmp[i];
            if (tmp[strLen-1] == strLen-1) break;
        }
        build_lcp(s);
    }
};
int n;
string s[2];
suffixArray suff;
ll hashCode[2][300000], pBase[300000];
int palin[2][300000];
void prepHash(){
    pBase[0] = 1;
    for(int i=1;i<300000;i++)
        pBase[i] = pBase[i-1] * base % mod;

    hashCode[0][0] = s[0][0] - 'a' + 1;
    hashCode[1][0] = s[1][0] - 'a' + 1;
    for(int i=1;i<n;i++)
        hashCode[0][i] = (hashCode[0][i-1] + pBase[i] * (s[0][i] - 'a' + 1)) % mod,
        hashCode[1][i] = (hashCode[1][i-1] + pBase[i] * (s[1][i] - 'a' + 1)) % mod;
}
bool checkPalindrome(int l1,int r1){
    int l2 = n-1-r1;
    int r2 = n-1-l1;

    ll val1 = (hashCode[0][r1] - (l1 == 0 ? 0 : hashCode[0][l1-1]) + mod) % mod;
    ll val2 = (hashCode[1][r2] - (l2 == 0 ? 0 : hashCode[1][l2-1]) + mod) % mod;
    val1 = val1 * pBase[max(0, r2 - r1)] % mod;
    val2 = val2 * pBase[max(0, r1 - r2)] % mod;
    return val1 == val2;
}
ll ans = 0;
bool check(int root, int rad, bool type){
    if (type){
        if (root - rad < 0 || root + rad >= n)  return 0;
        if (!checkPalindrome(root-rad, root+rad))   return 0;
        ll val1 = (hashCode[0][root + rad] - (root - rad == 0 ? 0 : hashCode[0][root - rad -1]) + mod) % mod * pBase[n-1 - (root+rad)] % mod;
        int len = 2 * rad + 1;
        int head = suff.saRank[root-rad];
        int far = head;
        int near = head;

        for(int k=20;k>=0;k--){
            if (far + (1<<k) < n && suff.getLcp(head, far + (1<<k)) >= len)
                far += (1<<k);
        }
        for(int k=20;k>=0;k--){
            if (near - (1<<k) >= 0 && suff.getLcp(near - (1<<k), head) >= len)
                near -= (1<<k);
        }
        ans = max(ans, 1ll * len * (far - near + 1));
        return 1;
    }
    else{
        if (root-1 - rad < 0 || root + rad >= n)  return 0;
        if (!checkPalindrome(root-1-rad, root+rad))   return 0;
        ll val1 = (hashCode[0][root + rad] - (root-1 - rad == 0 ? 0 : hashCode[0][root-1 - rad -1]) + mod) % mod * pBase[n-1 - (root+rad)] % mod;
        int len = 2 * (rad+1);
        int head = suff.saRank[root-1-rad];
        int far = head;
        int near = head;

        for(int k=20;k>=0;k--){
            if (far + (1<<k) < n && suff.getLcp(head, far + (1<<k)) >= len)
                far += (1<<k);
        }
        for(int k=20;k>=0;k--){
            if (near - (1<<k) >= 0 && suff.getLcp(near - (1<<k), head) >= len)
                near -= (1<<k);
        }
        ans = max(ans, 1ll * len * (far - near + 1));
        return 1;
    }
}
int main(){
    prepLg2(300000);
    iostream::sync_with_stdio(0);
    cin >> s[0];
    n = s[0].size();

    s[1] = s[0];
    reverse(s[1].begin(), s[1].end());

    suff.build(s[0]);
    prepHash();

    int pivot0 = -1, pivot1 = -1;
    for(int i=0;i<n;i++){
        pivot0 ++;
        pivot1 ++;
        while(pivot0 >= 0 && !check(i-pivot0, pivot0, 0))
            pivot0--;
        while(pivot1 >= 0 && !check(i-pivot1, pivot1, 1))
            pivot1--;
    }
    cout << ans;
}

Compilation message

palindrome.cpp: In function 'bool check(int, int, bool)':
palindrome.cpp:100:12: warning: unused variable 'val1' [-Wunused-variable]
         ll val1 = (hashCode[0][root + rad] - (root - rad == 0 ? 0 : hashCode[0][root - rad -1]) + mod) % mod * pBase[n-1 - (root+rad)] % mod;
            ^~~~
palindrome.cpp:120:12: warning: unused variable 'val1' [-Wunused-variable]
         ll val1 = (hashCode[0][root + rad] - (root-1 - rad == 0 ? 0 : hashCode[0][root-1 - rad -1]) + mod) % mod * pBase[n-1 - (root+rad)] % mod;
            ^~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 5628 KB Output is correct
2 Correct 20 ms 5628 KB Output is correct
3 Correct 22 ms 5628 KB Output is correct
4 Correct 19 ms 5628 KB Output is correct
5 Correct 22 ms 5632 KB Output is correct
6 Correct 24 ms 5632 KB Output is correct
7 Correct 17 ms 5632 KB Output is correct
8 Correct 18 ms 5632 KB Output is correct
9 Correct 20 ms 5632 KB Output is correct
10 Correct 36 ms 5632 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 18812 KB Output is correct
2 Correct 196 ms 18812 KB Output is correct
3 Correct 229 ms 18812 KB Output is correct
4 Correct 237 ms 18812 KB Output is correct
5 Correct 600 ms 18812 KB Output is correct
6 Correct 464 ms 18812 KB Output is correct
7 Correct 241 ms 18812 KB Output is correct
8 Correct 405 ms 18812 KB Output is correct
9 Correct 458 ms 18940 KB Output is correct
10 Correct 876 ms 18940 KB Output is correct

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 681 ms 48256 KB Output is correct
2 Correct 663 ms 48260 KB Output is correct
3 Correct 742 ms 48260 KB Output is correct
4 Correct 778 ms 48260 KB Output is correct
5 Execution timed out 1092 ms 48260 KB Time limit exceeded
6 Halted 0 ms 0 KB -