Submission #598162

#	Time	Username	Problem	Language	Result	Execution time	Memory
598162		OttoTheDino	Palindromic Partitions (CEOI17_palindromic)	C++17	0 / 100	0 ms	224 KiB

palindromic

#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
#define len(a)                      (int)a.size()
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

const int mod = 31415926, C = 29;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t; cin >> t;

    while (t--) {
        int p = 1, x = 0, y = 0, ans = 0; 
        string s; cin >> s;
        int n = len(s);
        rep (i,0,n-1) {

            if (2*i>=n-1) {
                ans++;
                break;
            }

            x = (x+(s[i]-'0')*p)%mod;
            y = (y*C+(s[n-1-i]-'0'))%mod;

            if (x==y) {
                ans += 2;
                p = 1;
                x = y = 0;
            }

            else p = (p * C) % mod;

        }

        cout << ans << "\n";
    }

    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 20
• Subtask 3: 0 / 25
• Subtask 4: 0 / 40