/// 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 {
int m;
ull h[N], dg[N];
void init(char *x) {
dg[0] = 1;
for (int i = 0; i <= n; i++) {
dg[i + 1] = dg[i] * p1;
if (i) {
h[i + 1] = h[i] * p1 + x[i];
}
}
}
ull get(int l, int r) {
return h[r + 1] - h[l] * dg[r - l + 1];
}
} t, t1;
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);
memset(dp, -0x3f, sizeof(dp));
dp[0] = 0;
t.init(s);
reverse(s + 1, s + 1 + n);
t1.init(s);
int go = (n + 1) >> 1;
int ptr = -1;
for (int i = 1; i <= n / 2; i++) {
int l = n - i + 1, r = n;
if (t.get(1, i) == t1.get(1, i) || t.get(1, i) == t.get(n - i + 1, n)) {
ptr = i;
}
}
int ans = (ptr < go);
while (ptr >= 1) {
bool ok = 0;
for (int i = ptr; i >= 1; i--) {
int l = n - ptr + 1, r = n - i + 1, len = ptr - i + 1;
if (check(i, l, len)) {
ptr = i - 1;
ans += 2;
ok = 1;
break;
}
}
}
cout << ans << nl;
return;
/*int ans = 1;
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;
ioi
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
Kazakhstan
int t = 1;
cin >> t;
while (t--) {
solve();
}
ioi
}
Compilation message
palindromic.cpp: In function 'void solve()':
palindromic.cpp:81:7: warning: unused variable 'l' [-Wunused-variable]
int l = n - i + 1, r = n;
^
palindromic.cpp:81:22: warning: unused variable 'r' [-Wunused-variable]
int l = n - i + 1, r = n;
^
palindromic.cpp:90:25: warning: unused variable 'r' [-Wunused-variable]
int l = n - ptr + 1, r = n - i + 1, len = ptr - i + 1;
^
palindromic.cpp:88:8: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
bool ok = 0;
^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
4344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
4344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
4344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
7 ms |
4344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
