oj.uz

Submission #46471

# Submission time Handle Problem Language Result Execution time Memory
46471 2018-04-21T02:46:56 Z RockyB Palindromic Partitions (CEOI17_palindromic) C++17
35 / 100
 10000 ms 4712 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];


bool check(int l1, int l2, int len) {
	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);
	memset(dp, -0x3f, sizeof(dp));
	dp[0] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = i; j >= 1; j--) {
			if (check(j, n - i + 1, i - j + 1)) {
				dp[i] = max(dp[i], dp[j - 1] + 1 + (j != n - i + 1));
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= n; i++) {
		if (i <= n / 2) ans = max(ans, dp[i]);
		int l = i, r = n - i + 1;
		if (l <= r) {
			ans = max(ans, dp[l - 1] + 1);
		}
	}
	cout << ans << 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 6 ms 4216 KB Output is correct
2 Correct 7 ms 4324 KB Output is correct
3 Correct 6 ms 4380 KB Output is correct
4 Correct 7 ms 4476 KB Output is correct
5 Correct 6 ms 4508 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 7 ms 4324 KB Output is correct
3 Correct 6 ms 4380 KB Output is correct
4 Correct 7 ms 4476 KB Output is correct
5 Correct 6 ms 4508 KB Output is correct
6 Correct 25 ms 4608 KB Output is correct
7 Correct 8 ms 4608 KB Output is correct
8 Correct 10 ms 4608 KB Output is correct
9 Correct 9 ms 4608 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 7 ms 4324 KB Output is correct
3 Correct 6 ms 4380 KB Output is correct
4 Correct 7 ms 4476 KB Output is correct
5 Correct 6 ms 4508 KB Output is correct
6 Correct 25 ms 4608 KB Output is correct
7 Correct 8 ms 4608 KB Output is correct
8 Correct 10 ms 4608 KB Output is correct
9 Correct 9 ms 4608 KB Output is correct
10 Execution timed out 10058 ms 4712 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4216 KB Output is correct
2 Correct 7 ms 4324 KB Output is correct
3 Correct 6 ms 4380 KB Output is correct
4 Correct 7 ms 4476 KB Output is correct
5 Correct 6 ms 4508 KB Output is correct
6 Correct 25 ms 4608 KB Output is correct
7 Correct 8 ms 4608 KB Output is correct
8 Correct 10 ms 4608 KB Output is correct
9 Correct 9 ms 4608 KB Output is correct
10 Execution timed out 10058 ms 4712 KB Time limit exceeded
11 Halted 0 ms 0 KB -