oj.uz

Submission #230646

# Submission time Handle Problem Language Result Execution time Memory
230646 2020-05-10T19:01:26 Z islingr Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 105 ms 17564 KB 
#include <iostream>
using namespace std;

#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(x, v) for (auto &x : v)

#define sz(x) int((x).size())

using ll = long long;
constexpr ll p = 5, M = 1e9 + 7, N = 1 << 20;

string s; int n;
ll pp[N], pref[N];

void init() {
	rep(i, 0, n) pref[i + 1] = (pref[i] + pp[i] * (s[i] - 'a' + 1)) % M;
}

ll hsh(int l, int r) { // [l, r]
	int ret = pref[r + 1] - pref[l];
	ret = ret * pp[n - l] % M;
	if (ret < 0) ret += M;
	return ret;
}

int solve() {
	cin >> s; n = sz(s);
	init();
	int cnt = 0;
	int x = 0, y = n - 1;
	bool found;
	while (x <= y) {
		int l = x, r = y;
		found = false;
		while (l < r) {
			if (hsh(x, l) == hsh(r, y)) {
				cnt += 2;
				found = true;
				break;
			}
			++l; --r;
		}
		x = l + 1;
		y = r - 1;
	}
	if (!found) ++cnt;
	return cnt;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	pp[0] = 1;
	rep(i, 1, N) pp[i] = p * pp[i - 1] % M;

	int t; cin >> t;
	while (t--) cout << solve() << '\n';
}

Compilation message

palindromic.cpp: In function 'int solve()':
palindromic.cpp:46:2: warning: 'found' may be used uninitialized in this function [-Wmaybe-uninitialized]
  if (!found) ++cnt;
  ^~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8576 KB Output is correct
2 Correct 13 ms 8576 KB Output is correct
3 Correct 13 ms 8576 KB Output is correct
4 Correct 13 ms 8576 KB Output is correct
5 Correct 13 ms 8576 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8576 KB Output is correct
2 Correct 13 ms 8576 KB Output is correct
3 Correct 13 ms 8576 KB Output is correct
4 Correct 13 ms 8576 KB Output is correct
5 Correct 13 ms 8576 KB Output is correct
6 Correct 15 ms 8576 KB Output is correct
7 Correct 13 ms 8576 KB Output is correct
8 Correct 13 ms 8628 KB Output is correct
9 Correct 13 ms 8576 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8576 KB Output is correct
2 Correct 13 ms 8576 KB Output is correct
3 Correct 13 ms 8576 KB Output is correct
4 Correct 13 ms 8576 KB Output is correct
5 Correct 13 ms 8576 KB Output is correct
6 Correct 15 ms 8576 KB Output is correct
7 Correct 13 ms 8576 KB Output is correct
8 Correct 13 ms 8628 KB Output is correct
9 Correct 13 ms 8576 KB Output is correct
10 Correct 14 ms 8704 KB Output is correct
11 Correct 13 ms 8704 KB Output is correct
12 Correct 14 ms 8704 KB Output is correct
13 Correct 14 ms 8576 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 8576 KB Output is correct
2 Correct 13 ms 8576 KB Output is correct
3 Correct 13 ms 8576 KB Output is correct
4 Correct 13 ms 8576 KB Output is correct
5 Correct 13 ms 8576 KB Output is correct
6 Correct 15 ms 8576 KB Output is correct
7 Correct 13 ms 8576 KB Output is correct
8 Correct 13 ms 8628 KB Output is correct
9 Correct 13 ms 8576 KB Output is correct
10 Correct 14 ms 8704 KB Output is correct
11 Correct 13 ms 8704 KB Output is correct
12 Correct 14 ms 8704 KB Output is correct
13 Correct 14 ms 8576 KB Output is correct
14 Correct 105 ms 17564 KB Output is correct
15 Correct 64 ms 17552 KB Output is correct
16 Correct 95 ms 17428 KB Output is correct
17 Correct 62 ms 13340 KB Output is correct