oj.uz

Submission #43237

# Submission time Handle Problem Language Result Execution time Memory
43237 2018-03-11T09:27:45 Z krauch Palindromic Partitions (CEOI17_palindromic) C++14
60 / 100
 10000 ms 30792 KB 
/*
 _    _    _______   _    _
| |  / /  |  _____| | |  / /
| | / /   | |       | | / /
| |/ /    | |_____  | |/ /
| |\ \    |  _____| | |\ \
| | \ \   | |       | | \ \
| |  \ \  | |_____  | |  \ \
|_|   \_\ |_______| |_|   \_\

*/
#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef double ld;
typedef pair <int, int> PII;
typedef pair <ll, ll> PLL;
typedef pair < ll, int > PLI;


#define F first
#define S second
#define pb push_back
#define eb emplace_back
#define right(x) x << 1 | 1
#define left(x) x << 1
#define forn(x, a, b) for (int x = a; x <= b; ++x)
#define for1(x, a, b) for (int x = a; x >= b; --x)
#define mkp make_pair
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define y1 kekekek

#define fname ""

const ll ool = 1e18 + 9;
const int oo = 1e9 + 9, base = 1e9 + 7;
const ld eps = 1e-7;
const int N = 2e6 + 6;

int d[N], mn[N];
ll hs[N], p[N], pr = 37;
char a[N];

ll get(int l, int r) {
    return (hs[r] - hs[l - 1] * p[r - l + 1] % base + base) % base;
}

int main() {
	ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

	#ifdef krauch
        freopen("input.txt", "r", stdin);
    #else
        //freopen(fname".in", "r", stdin);
        //freopen(fname".out", "w", stdout);
    #endif

    int T;
    cin >> T;
    while (T--) {
        string s;
        cin >> s;
        int n = sz(s);
        p[0] = 1;
        forn(i, 1, n) {
            a[i] = s[i - 1];
            hs[i] = (hs[i - 1] * pr + a[i] - 'a') % base;
            p[i] = p[i - 1] * pr % base;
        }

        if (n & 1) d[n / 2 + 1] = 1;
        else d[n / 2 + 1] = 0;
        mn[n / 2 + 1] = 0;
        for1(i, n / 2, 1) {
            mn[i] = 0;
            forn(j, 1, n / 2 - i + 1) {
                if (get(i, i + j - 1) == get(n - i - j + 2, n - i + 1)) {
                    mn[i] = j;
                    break;
                }
            }
            if (mn[i]) d[i] = d[i + mn[i]] + 2;
            else d[i] = 1;
        }
        cout << d[1] << "\n";
    }

	return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 1 ms 496 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 1 ms 496 KB Output is correct
6 Correct 1 ms 568 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 1 ms 620 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 1 ms 496 KB Output is correct
6 Correct 1 ms 568 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 231 ms 896 KB Output is correct
12 Correct 28 ms 1004 KB Output is correct
13 Correct 4 ms 1004 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 2 ms 440 KB Output is correct
5 Correct 1 ms 496 KB Output is correct
6 Correct 1 ms 568 KB Output is correct
7 Correct 2 ms 568 KB Output is correct
8 Correct 2 ms 584 KB Output is correct
9 Correct 1 ms 620 KB Output is correct
10 Correct 6 ms 876 KB Output is correct
11 Correct 231 ms 896 KB Output is correct
12 Correct 28 ms 1004 KB Output is correct
13 Correct 4 ms 1004 KB Output is correct
14 Correct 2474 ms 30792 KB Output is correct
15 Execution timed out 10079 ms 30792 KB Time limit exceeded
16 Halted 0 ms 0 KB -