oj.uz

Submission #47394

# Submission time Handle Problem Language Result Execution time Memory
47394 2018-05-02T10:51:39 Z RockyB Palindromic Partitions (CEOI17_palindromic) C++17
100 / 100
 92 ms 32484 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)1e6 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n;
char s[N];
int dp[N];



const int p1 = 997;

struct hs {
	ull h[N], dg[N];
	void init() {
		dg[0] = 1;
		for (int i = 0; i <= n; i++) {
			dg[i + 1] = dg[i] * p1;
			if (i) h[i + 1] = h[i] * p1 + s[i];
		}
	}
	ull get(int l, int r) {
		return h[r + 1] - h[l] * dg[r - l + 1];
	}
} t;

bool check(int l1, int l2, int len) {
	return t.get(l1, l1 + len - 1) == t.get(l2, l2 + len - 1);
	for (int i = 0; i < len; i++) {
		if (s[i + l1] != s[i + l2]) return 0;
	}
	return 1;
}
void solve() {
	cin >> (s + 1);
	n = strlen(s + 1);
	t.init();
	int l = 1, r = n, res = 0;
	while (l <= r) {
		int len = 1;
		while (!check(l, r - len + 1, len)) len++;
		if (l + len - 1 >= r - len + 1) res++;
		else res += 2;
		l += len;
		r -= len;
	}
	cout << res << nl;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	int t = 1;
	cin >> t;
	while (t--) {
		solve();
	}
	ioi
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 512 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 520 KB Output is correct
8 Correct 2 ms 544 KB Output is correct
9 Correct 2 ms 560 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 520 KB Output is correct
8 Correct 2 ms 544 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 3 ms 688 KB Output is correct
13 Correct 2 ms 740 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 488 KB Output is correct
3 Correct 2 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 520 KB Output is correct
8 Correct 2 ms 544 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 3 ms 688 KB Output is correct
13 Correct 2 ms 740 KB Output is correct
14 Correct 84 ms 18148 KB Output is correct
15 Correct 50 ms 23284 KB Output is correct
16 Correct 92 ms 32484 KB Output is correct
17 Correct 46 ms 32484 KB Output is correct