oj.uz

Submission #887717

# Submission time Handle Problem Language Result Execution time Memory
887717 2023-12-15T04:59:37 Z phong Palindromes (APIO14_palindrome) C++17
23 / 100
 306 ms 131072 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>

#define ll long long
#define ull unsigned ll
const int nmax = 6e5 + 5;
const ll oo = 1e18;
const int lg = 17;
const ll base = 311;
const ll mod = 1e9 + 7;
#define pii pair<int, int>
#define fi first
#define se second
#define debug(a, n) for(int i = 1; i <= n; ++i) cout << a[i] << ' ';
using namespace std;


int n, cur = 0;
string s;
ll pw[nmax];
ll rmq[2][nmax][lg + 1];
int D_odd[nmax];
int D_even[nmax];

void Calc_D_odd() {
    int L = 1;
    int R = 0;
    for(int i = 1 ; i <= n; i++) {
        if(i > R) D_odd[i] = 0;
        else D_odd[i] = min(R - i, D_odd[L + (R - i)]);
        while(i - D_odd[i] - 1 > 0 && i + D_odd[i] + 1 <= n && s[i - D_odd[i] - 1] == s[i + D_odd[i] + 1]) {
            D_odd[i]++;
        }

        if(i + D_odd[i] > R) {
            R = i + D_odd[i];
            L = i - D_odd[i];
        }
    }
}

void Calc_D_even() {
    int L = 1;
    int R = 0;
    for(int i = 1 ; i < n; i++) {
        int j = i + 1;
        if(j > R) D_even[i] = 0;
        else D_even[i] = min(R - j + 1, D_even[L + (R - j)]);
        while(i - D_even[i] > 0 && j + D_even[i] <= n && s[i - D_even[i]] == s[j + D_even[i]]) {
            D_even[i]++;
        }
        if(i + D_even[i] > R) {
            R = i + D_even[i];
            L = j - D_even[i];
        }
    }
}

ll combine(ll a, ll b, int x){
    return a * pw[x] + b;
}
void Init(){
    pw[0] = 1;
    for(int i = 1, j; i <= n; ++i){
        pw[i] = pw[i - 1] * base;
        rmq[0][i][0] = s[i] - 'a' + 1;
        rmq[1][i][0] = s[n - i + 1] - 'a' + 1;
    }
    for(int j = 1; j <= lg; ++j){
        for(int i = 1; i + (1 << j) - 1 <= n; ++i){
            for(int t = 0; t < 2; ++t){
                rmq[t][i][j] = combine(rmq[t][i][j - 1], rmq[t][i + (1 << (j - 1))][j - 1], 1 << (j - 1));
            }
        }
    }
}
ll get(int l, int r, int t){
    int k = r - l + 1;
    ll res = 0;
    for(int j = 0; j <= __lg(k); ++j){
        if(k >> j & 1){
            res = combine(res, rmq[t][l][j], 1 << j);
            l += 1 << j;
        }
    }
    return res;
}

bool check(int l, int r){
    return get(l, r, 0) == get(n - r + 1, n - l + 1, 1);
}

map<ll, bool> mp;
map<ll, ll >  par, ind;
int cnt[nmax];
ll f[nmax];

void update(int l, int r){
    int u = l, v = r;
    bool ok = 1;
    while(l <= r){
        ll x = get(l, r, 0);
        if(!mp[x]){
            ind[x] = ++cur;
            if(ok){
                f[cur]++;
                ok = 0;
            }
            cnt[cur] = r - l + 1;
            if(l + 1 <= r - 1){
                par[x] = get(l + 1, r - 1, 0);
            }
            mp[x] = 1;

        }
        else{
            if(ok){

                int id = ind[x];
                f[id]++;
            }
            break;
        }
        ++l, --r;
    }
}
vector<int> adj[nmax];
void dfs(int u){
    for(auto v : adj[u]){
        dfs(v);
        f[u] += f[v];
    }
}
main(){
    ios_base::sync_with_stdio(0);
//    cin.tie(0);cout.tie(0);
//    freopen("code.inp", "r", stdin);
//    freopen("code.out", "w", stdout);
    cin >> s;
    n = s.size(); s = ' ' + s + ' ';
    Init();
    Calc_D_odd();
    Calc_D_even();
    for(int i = 1; i <= n; ++i){
        update(i - D_odd[i], i + D_odd[i]);
        if(i < n) update(i - D_even[i] + 1, i + D_even[i]);
    }
    for(auto [x, y] : mp){
        int v = ind[x];
        int u = ind[par[x]];
        adj[u].push_back(v);
    }
    dfs(0);
    ll ans = 0;
    for(int i = 1; i <= cur; ++i){
        ans = max(ans, 1ll * f[i] * cnt[i]);
    }
    cout << ans;
}
/*

*/

Compilation message

palindrome.cpp: In function 'void Init()':
palindrome.cpp:66:20: warning: unused variable 'j' [-Wunused-variable]
   66 |     for(int i = 1, j; i <= n; ++i){
      |                    ^
palindrome.cpp: In function 'void update(int, int)':
palindrome.cpp:101:9: warning: unused variable 'u' [-Wunused-variable]
  101 |     int u = l, v = r;
      |         ^
palindrome.cpp:101:16: warning: unused variable 'v' [-Wunused-variable]
  101 |     int u = l, v = r;
      |                ^
palindrome.cpp: At global scope:
palindrome.cpp:136:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  136 | main(){
      | ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 27228 KB Output is correct
2 Correct 5 ms 27228 KB Output is correct
3 Correct 7 ms 27480 KB Output is correct
4 Correct 6 ms 27224 KB Output is correct
5 Correct 6 ms 27228 KB Output is correct
6 Correct 7 ms 27228 KB Output is correct
7 Correct 6 ms 27228 KB Output is correct
8 Correct 5 ms 27280 KB Output is correct
9 Correct 6 ms 27228 KB Output is correct
10 Correct 5 ms 27228 KB Output is correct
11 Correct 6 ms 27228 KB Output is correct
12 Correct 5 ms 27228 KB Output is correct
13 Correct 6 ms 27228 KB Output is correct
14 Correct 6 ms 27236 KB Output is correct
15 Correct 6 ms 27228 KB Output is correct
16 Correct 6 ms 27228 KB Output is correct
17 Correct 6 ms 27224 KB Output is correct
18 Correct 6 ms 27228 KB Output is correct
19 Correct 6 ms 27228 KB Output is correct
20 Correct 6 ms 27224 KB Output is correct
21 Correct 6 ms 27228 KB Output is correct
22 Correct 6 ms 27240 KB Output is correct
23 Correct 6 ms 27228 KB Output is correct
24 Correct 6 ms 27228 KB Output is correct
25 Correct 6 ms 27268 KB Output is correct
26 Correct 6 ms 27184 KB Output is correct
27 Correct 6 ms 27224 KB Output is correct
28 Correct 6 ms 27228 KB Output is correct
29 Correct 6 ms 27228 KB Output is correct
30 Correct 5 ms 27312 KB Output is correct
31 Correct 6 ms 27428 KB Output is correct
32 Correct 6 ms 27228 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 27484 KB Output is correct
2 Correct 7 ms 27484 KB Output is correct
3 Correct 7 ms 27504 KB Output is correct
4 Correct 8 ms 27300 KB Output is correct
5 Correct 7 ms 27496 KB Output is correct
6 Correct 7 ms 27484 KB Output is correct
7 Correct 7 ms 27480 KB Output is correct
8 Correct 7 ms 27484 KB Output is correct
9 Correct 6 ms 27456 KB Output is correct
10 Correct 6 ms 27284 KB Output is correct
11 Correct 7 ms 27228 KB Output is correct
12 Correct 6 ms 27236 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 33628 KB Output is correct
2 Correct 19 ms 33628 KB Output is correct
3 Correct 21 ms 33620 KB Output is correct
4 Correct 20 ms 33624 KB Output is correct
5 Correct 17 ms 33740 KB Output is correct
6 Correct 19 ms 33716 KB Output is correct
7 Correct 18 ms 33628 KB Output is correct
8 Correct 7 ms 31324 KB Output is correct
9 Correct 8 ms 31512 KB Output is correct
10 Incorrect 9 ms 32092 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 252 ms 83704 KB Output is correct
2 Correct 245 ms 82936 KB Output is correct
3 Correct 306 ms 83628 KB Output is correct
4 Correct 270 ms 83148 KB Output is correct
5 Correct 210 ms 83252 KB Output is correct
6 Correct 152 ms 76564 KB Output is correct
7 Correct 209 ms 79096 KB Output is correct
8 Correct 30 ms 58360 KB Output is correct
9 Correct 74 ms 63520 KB Output is correct
10 Incorrect 75 ms 66552 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Runtime error 132 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -