oj.uz

Submission #265514

# Submission time Handle Problem Language Result Execution time Memory
265514 2020-08-14T23:19:05 Z square1001 Palindromes (APIO14_palindrome) C++14
23 / 100
 1000 ms 88220 KB 
// APIO 2014 Problem 1 - Palindromes

#include <string>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
	// step #1. read input
	string S;
	cin >> S;
	int N = S.size();
	// step #2. construct suffix array of T = S + "#" + rev(S)
	string RS = S;
	reverse(RS.begin(), RS.end());
	string T = S + "#" + RS;
	vector<int> sa_inv(2 * N + 1);
	for(int i = 0; i < 2 * N + 1; ++i) {
		sa_inv[i] = int(T[i]);
	}
	for(int i = 1; i < 2 * N + 1; i *= 2) {
		vector<pair<int, int> > nseq(2 * N + 1);
		for(int j = 0; j < 2 * N + 1; ++j) {
			nseq[j] = make_pair(sa_inv[j], j + i < 2 * N + 1 ? sa_inv[j + i] : -1);
		}
		vector<pair<int, int> > sseq(nseq);
		sort(sseq.begin(), sseq.end());
		sseq.erase(unique(sseq.begin(), sseq.end()), sseq.end());
		for(int j = 0; j < 2 * N + 1; ++j) {
			sa_inv[j] = lower_bound(sseq.begin(), sseq.end(), nseq[j]) - sseq.begin();
		}
	}
	vector<int> sa(2 * N + 1);
	for(int i = 0; i < 2 * N + 1; ++i) {
		sa[sa_inv[i]] = i;
	}
	// step #3. construct rolling-hash table and rolling-hash function
	const int mod = 469762049;
	const int base = 311;
	vector<int> pw(2 * N + 2), h(2 * N + 2);
	pw[0] = 1;
	for(int i = 0; i < 2 * N + 1; ++i) {
		pw[i + 1] = 1LL * pw[i] * base % mod;
		h[i + 1] = (1LL * h[i] * base + T[i]) % mod;
	}
	function<int(int, int)> gethash = [&](int l, int r) {
		return (h[r] - 1LL * h[l] * pw[r - l] % mod + mod) % mod;
	};
	// step #4. calculate LCP
	vector<int> lcp(2 * N);
	for(int i = 0; i < 2 * N; ++i) {
		int l = 0, r = (2 * N + 1) - max(sa[i], sa[i + 1]) + 1;
		while(r - l > 1) {
			int m = (l + r) >> 1;
			if(gethash(sa[i], sa[i] + m) == gethash(sa[i + 1], sa[i + 1] + m)) l = m;
			else r = m;
		}
		lcp[i] = l;
	}
	// step #5. calculate types and lengths of elements in suffix array
	vector<pair<int, int> > trait(2 * N + 1);
	for(int i = 0; i < 2 * N + 1; ++i) {
		if(sa[i] == N) trait[i] = make_pair(0, -1);
		else if(sa[i] < N) trait[i] = make_pair(1, N - sa[i]);
		else trait[i] = make_pair(2, (2 * N + 1) - sa[i]);
	}
	// step #6. calculate the answer
	function<long long(int, int)> solve = [&](int l, int r) {
		int baselen = trait[l].second;
		for(int i = l; i < r - 1; ++i) {
			baselen = min(baselen, lcp[i]);
		}
		vector<int> len1, len2;
		for(int i = l; i < r; ++i) {
			if(trait[i].first == 1) len1.push_back(trait[i].second);
			if(trait[i].first == 2) len2.push_back(trait[i].second);
		}
		sort(len2.begin(), len2.end());
		int ct1 = 0, ct2 = 0;
		for(int i : len1) {
			if(binary_search(len2.begin(), len2.end(), N - i)) ++ct1;
			if(binary_search(len2.begin(), len2.end(), N - i + 1)) ++ct2;
		}
		long long ans = 0;
		ans = max(ans, 1LL * (baselen * 2) * ct1);
		ans = max(ans, 1LL * (baselen * 2 - 1) * ct2);
		if(r - l > 1) {
			int pre = l;
			for(int i = l; i < r; ++i) {
				if(i == r - 1 || lcp[i] == baselen) {
					long long res = solve(pre, i + 1);
					ans = max(ans, res);
					pre = i + 1;
				}
			}
		}
		return ans;
	};
	long long ans = solve(1, 2 * N + 1);
	// step #7. print the answer
	cout << ans << endl;
	return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 3236 KB Output is correct
2 Correct 20 ms 1324 KB Output is correct
3 Correct 46 ms 5880 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 50 ms 5880 KB Output is correct
6 Correct 43 ms 5752 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 41 ms 3248 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 6 ms 384 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct

Subtask #3
0 / 24.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1101 ms 88220 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 26.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1097 ms 55136 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1050 ms 13388 KB Time limit exceeded
2 Halted 0 ms 0 KB -