# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624765 | Alma | Palindromic Partitions (CEOI17_palindromic) | C++17 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
using ll = long long;
using ii = pair<int,int>;
const int INF = 1e9;
const ll LLINF = 1e18;
using vi = vector<int>;
using vvi = vector<vi>;
void setIO (string fileName) {
ios::sync_with_stdio(false);
cin.tie(NULL);
if (fileName != "std") {
freopen((fileName + ".in").c_str(), "r", stdin);
freopen((fileName + ".out").c_str(), "w", stdout);
}
}
int main() {
setIO("std");
int tc;
cin >> tc;
while (tc--) {
string s;
cin >> s;
int n = s.size();
ll B = 231, M = 1e9+7;
vector<ll> p(n), hs(n+1);
p[0] = 1;
for (int i = 0; i < n; i++) {
if (i > 0) p[i] = (p[i-1] * B) % M;
hs[i+1] = (hs[i] * B + s[i]) % M;
cerr << hs[i+1] << '\n';
}
int l = 0, r = n, ans = 0;
while (l < r) {
int k = 1;
while (hs[l+k] - (hs[l] * p[k]) % M != hs[r] - (hs[r-k] * p[k]) % M) {
k++;
}
if (l+k == r) ans++;
else ans += 2;
l = l+k;
r = r-k;
}
cout << ans << '\n';
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |