oj.uz

Submission #161882

# Submission time Handle Problem Language Result Execution time Memory
161882 2019-11-05T06:05:45 Z amoo_safar Palindromic Partitions (CEOI17_palindromic) C++14
100 / 100
 96 ms 20676 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

const ll Mod = 998244353;
const ll Inf = 2242545357980376863LL;
const ll Log = 20;
const ll N = 1ll << Log;
const int Maxn = 1e6 + 10;
const int Base = 101;

ll pw[Maxn];

void MAIN(){
	str s;
	cin >> s;
	ll n = s.size();
	ll ans = 0;
	ll l = 0;
	ll h1 = 0, h2 = 0;
	for(int i = 0, j = n - 1; i < n; i++, j--){
		h1 = (h1 * Base + s[i]) % Mod;
		h2 = (h2 + pw[l] * s[j]) % Mod;
		if(h1 == h2){
			ans ++;
			h1 = 0;
			h2 = 0;
			l = 0;
		} else l ++;
	}
	
	cout << ans << '\n';
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	pw[0] = 1;
	for(int i = 1; i < Maxn; i++) pw[i] = (pw[i - 1] * Base) % Mod;
	ll T;
	cin >> T;
	while(T--) MAIN();
	return 0;
}
/*
4
bonobo
deleted
racecar
racecars
*/

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8184 KB Output is correct
2 Correct 14 ms 8184 KB Output is correct
3 Correct 16 ms 8184 KB Output is correct
4 Correct 14 ms 8184 KB Output is correct
5 Correct 14 ms 8184 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8184 KB Output is correct
2 Correct 14 ms 8184 KB Output is correct
3 Correct 16 ms 8184 KB Output is correct
4 Correct 14 ms 8184 KB Output is correct
5 Correct 14 ms 8184 KB Output is correct
6 Correct 14 ms 8184 KB Output is correct
7 Correct 14 ms 8184 KB Output is correct
8 Correct 14 ms 8184 KB Output is correct
9 Correct 14 ms 8184 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8184 KB Output is correct
2 Correct 14 ms 8184 KB Output is correct
3 Correct 16 ms 8184 KB Output is correct
4 Correct 14 ms 8184 KB Output is correct
5 Correct 14 ms 8184 KB Output is correct
6 Correct 14 ms 8184 KB Output is correct
7 Correct 14 ms 8184 KB Output is correct
8 Correct 14 ms 8184 KB Output is correct
9 Correct 14 ms 8184 KB Output is correct
10 Correct 14 ms 8292 KB Output is correct
11 Correct 15 ms 8224 KB Output is correct
12 Correct 14 ms 8312 KB Output is correct
13 Correct 15 ms 8312 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8184 KB Output is correct
2 Correct 14 ms 8184 KB Output is correct
3 Correct 16 ms 8184 KB Output is correct
4 Correct 14 ms 8184 KB Output is correct
5 Correct 14 ms 8184 KB Output is correct
6 Correct 14 ms 8184 KB Output is correct
7 Correct 14 ms 8184 KB Output is correct
8 Correct 14 ms 8184 KB Output is correct
9 Correct 14 ms 8184 KB Output is correct
10 Correct 14 ms 8292 KB Output is correct
11 Correct 15 ms 8224 KB Output is correct
12 Correct 14 ms 8312 KB Output is correct
13 Correct 15 ms 8312 KB Output is correct
14 Correct 96 ms 20676 KB Output is correct
15 Correct 62 ms 15768 KB Output is correct
16 Correct 96 ms 19704 KB Output is correct
17 Correct 56 ms 14772 KB Output is correct