Submission #479254

#	Time	Username	Problem	Language	Result	Execution time	Memory
479254		NhatMinh0208	Palindromic Partitions (CEOI17_palindromic)	C++14	100 / 100	120 ms	34620 KiB

palindromic

#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
ll n,m,i,j,k,t,t1,u,v,a,b;
ll hah[1000001];
ll p29[1000001];
ll i29[1000001];
string s;
ll get(ll l, ll r){
  return (hah[r]-hah[l]+MOD)*i29[l]%MOD;
}
int main()
{
	fio;
  	cin>>t;
	p29[0]=i29[0]=1;
  	for (i=1;i<=1000000;i++) {
      p29[i]=p29[i-1]*29;
      p29[i]%=MOD;
    }
  	i29[1000000]=INV(p29[1000000],MOD);
  	for (i=999999;i>=1;i--) {
      i29[i]=i29[i+1]*29;
      i29[i]%=MOD;
    }
  	for (t1=0;t1<t;t1++) {
      cin>>s;
      n=s.length();
      u=1;
      for (i=1;i<=n;i++) {
        hah[i]=hah[i-1]+(s[i-1]-96)*u;
       	hah[i]%=MOD;
        u*=29;
        u%=MOD;
      }
      j=0;
      u=0;
      for (i=1;i<=n/2;i++) {
        if (get(j,i)==get(n-i,n-j)) {
          u+=2;
          j=i;
        }
      }
        if (j*2<n) u++;
      cout<<u<<endl;
    }
}

Compilation message (stderr)

palindromic.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      |

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