Submission #1277050

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277050		PlayVoltz	Palindromic Partitions (CEOI17_palindromic)	C++20	100 / 100	37 ms	3232 KiB

palindromic

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
using namespace std;
 
#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

const int A = 696967;
const int B = 1000000007;

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while (t--){
		string s;
		cin>>s;
		int i=0, ans=0;
		while (i<s.size()-s.size()/2){
			int l=0, r=0;
			bool got=0;
			for (int e=1; i<s.size()-s.size()/2; ++i, e=(e*A)%B){
				l=(l*A+s[i])%B;
				r=(r+s[s.size()-i-1]*e)%B;
				if (l==r){
					ans+=2-(i==s.size()-i-1);
					got=1;
					break;
				}
			}
			if (i==s.size()-s.size()/2&&!got)++ans;
			if (i==s.size()-s.size()/2)break;
			++i;
		}
		cout<<ans<<"\n";
	}
}

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