oj.uz

Submission #44683

# Submission time Handle Problem Language Result Execution time Memory
44683 2018-04-04T19:44:33 Z bogdan10bos Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 184 ms 42368 KB 
#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

typedef pair<char, char> pcc;
typedef long long LL;

const int base = 31;

int N;
int dp[1000005];
char s[1000005];
LL pw[1000005], hsh[1000005];
vector<int> mp[35][35];

int get_hash(int st, int dr)
{
    return hsh[dr] - hsh[st - 1] * pw[dr - st + 1];
}

void solve_test()
{
    scanf("%s", s + 1);
    N = strlen(s + 1);
    for(int i = 1; i <= N; i++)
        hsh[i] = (1LL * hsh[i - 1] * base) + s[i] - 'a' + 1;
    int ans = 1;

    for(int i = 0; i < 26; i++)
        for(int j = 0; j < 26; j++)
            mp[i][j].clear();

    for(int st = 1, dr = N; st < dr; st++, dr--)
    {
        dp[st] = 0;
        for(auto pos: mp[s[dr] - 'a'][s[st] - 'a'])
        {
            int lgt = st - pos + 1;
            if(dp[pos - 1] > 0 && get_hash(pos, st) == get_hash(dr, dr + lgt - 1))
                dp[st] = max(dp[st], dp[pos - 1] + 2);
        }
        if(get_hash(1, st) == get_hash(dr, N))
            dp[st] = max(dp[st], 2);
        if(s[st] == s[dr] && dp[st - 1])
            dp[st] = max(dp[st], dp[st - 1] + 2);
        ans = max(ans, dp[st] + (st + 1 < dr ? 1 : 0));
        if(dp[st - 1] != 0)
        {
            mp[ s[st] - 'a' ][ s[dr] - 'a' ].clear();
            mp[s[st] - 'a'][ s[dr] - 'a'].push_back(st);
        }
    }

    printf("%d\n", ans);
}

int main()
{
    #ifdef FILE_IO
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    #endif

    pw[0] = 1;
    int N = 1e6;
    for(int i = 1; i <= N; i++)
        pw[i] = 1LL * pw[i - 1] * base;

    int T;
    scanf("%d\n", &T);
    for(int t = 1; t <= T; t++)
        solve_test();

    return 0;
}

Compilation message

palindromic.cpp: In function 'void solve_test()':
palindromic.cpp:25:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", s + 1);
     ~~~~~^~~~~~~~~~~~~
palindromic.cpp: In function 'int main()':
palindromic.cpp:72:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d\n", &T);
     ~~~~~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8184 KB Output is correct
2 Correct 7 ms 8296 KB Output is correct
3 Correct 7 ms 8364 KB Output is correct
4 Correct 7 ms 8364 KB Output is correct
5 Correct 8 ms 8380 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8184 KB Output is correct
2 Correct 7 ms 8296 KB Output is correct
3 Correct 7 ms 8364 KB Output is correct
4 Correct 7 ms 8364 KB Output is correct
5 Correct 8 ms 8380 KB Output is correct
6 Correct 7 ms 8380 KB Output is correct
7 Correct 8 ms 8428 KB Output is correct
8 Correct 7 ms 8444 KB Output is correct
9 Correct 8 ms 8444 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8184 KB Output is correct
2 Correct 7 ms 8296 KB Output is correct
3 Correct 7 ms 8364 KB Output is correct
4 Correct 7 ms 8364 KB Output is correct
5 Correct 8 ms 8380 KB Output is correct
6 Correct 7 ms 8380 KB Output is correct
7 Correct 8 ms 8428 KB Output is correct
8 Correct 7 ms 8444 KB Output is correct
9 Correct 8 ms 8444 KB Output is correct
10 Correct 9 ms 8572 KB Output is correct
11 Correct 8 ms 8572 KB Output is correct
12 Correct 9 ms 8572 KB Output is correct
13 Correct 9 ms 8572 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 8184 KB Output is correct
2 Correct 7 ms 8296 KB Output is correct
3 Correct 7 ms 8364 KB Output is correct
4 Correct 7 ms 8364 KB Output is correct
5 Correct 8 ms 8380 KB Output is correct
6 Correct 7 ms 8380 KB Output is correct
7 Correct 8 ms 8428 KB Output is correct
8 Correct 7 ms 8444 KB Output is correct
9 Correct 8 ms 8444 KB Output is correct
10 Correct 9 ms 8572 KB Output is correct
11 Correct 8 ms 8572 KB Output is correct
12 Correct 9 ms 8572 KB Output is correct
13 Correct 9 ms 8572 KB Output is correct
14 Correct 184 ms 27876 KB Output is correct
15 Correct 92 ms 33064 KB Output is correct
16 Correct 158 ms 42284 KB Output is correct
17 Correct 93 ms 42368 KB Output is correct