oj.uz

Submission #500948

# Submission time Handle Problem Language Result Execution time Memory
500948 2022-01-01T18:02:34 Z dxz05 Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 98 ms 19708 KB 
#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 998244353;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 222;

ll A = 998244353, B = 1e9 + 7;
ll pw[N];

void solve(int TC) {
    string s;
    cin >> s;

    int l = 0, r = s.size() - 1;
    int ans = 0, cnt = 0;
    ll lf = 0, rg = 0;
    while (l <= r){
        cnt++;
        lf = (lf * A + s[l]) % B;
        rg = (pw[cnt - 1] * s[r] + rg) % B;
        if (lf == rg){
            ans += 2 - (l == r);
//            cout << lf << ' ' << rg << endl;
            lf = rg = 0;
            cnt = 0;
        }
        l++;
        r--;
    }

    if (lf != 0) ans++;

    cout << ans << endl;

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    pw[0] = 1;
    for (int i = 1; i < N; i++) pw[i] = pw[i - 1] * A % B;

    int TC = 1;
    cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8140 KB Output is correct
2 Correct 12 ms 8140 KB Output is correct
3 Correct 13 ms 8084 KB Output is correct
4 Correct 12 ms 8132 KB Output is correct
5 Correct 12 ms 8044 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8140 KB Output is correct
2 Correct 12 ms 8140 KB Output is correct
3 Correct 13 ms 8084 KB Output is correct
4 Correct 12 ms 8132 KB Output is correct
5 Correct 12 ms 8044 KB Output is correct
6 Correct 12 ms 8140 KB Output is correct
7 Correct 13 ms 8140 KB Output is correct
8 Correct 12 ms 8140 KB Output is correct
9 Correct 13 ms 8140 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8140 KB Output is correct
2 Correct 12 ms 8140 KB Output is correct
3 Correct 13 ms 8084 KB Output is correct
4 Correct 12 ms 8132 KB Output is correct
5 Correct 12 ms 8044 KB Output is correct
6 Correct 12 ms 8140 KB Output is correct
7 Correct 13 ms 8140 KB Output is correct
8 Correct 12 ms 8140 KB Output is correct
9 Correct 13 ms 8140 KB Output is correct
10 Correct 15 ms 8160 KB Output is correct
11 Correct 14 ms 8140 KB Output is correct
12 Correct 14 ms 8060 KB Output is correct
13 Correct 14 ms 8060 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8140 KB Output is correct
2 Correct 12 ms 8140 KB Output is correct
3 Correct 13 ms 8084 KB Output is correct
4 Correct 12 ms 8132 KB Output is correct
5 Correct 12 ms 8044 KB Output is correct
6 Correct 12 ms 8140 KB Output is correct
7 Correct 13 ms 8140 KB Output is correct
8 Correct 12 ms 8140 KB Output is correct
9 Correct 13 ms 8140 KB Output is correct
10 Correct 15 ms 8160 KB Output is correct
11 Correct 14 ms 8140 KB Output is correct
12 Correct 14 ms 8060 KB Output is correct
13 Correct 14 ms 8060 KB Output is correct
14 Correct 90 ms 16544 KB Output is correct
15 Correct 62 ms 15528 KB Output is correct
16 Correct 98 ms 19708 KB Output is correct
17 Correct 52 ms 14644 KB Output is correct