Submission #1113848

#	Time	Username	Problem	Language	Result	Execution time	Memory
1113848		KarolZ	Palindromes (APIO14_palindrome)	C++17	0 / 100	525 ms	50728 KiB

palindrome

#include<bits/stdc++.h>
#include<unordered_map>
using namespace std;
typedef __int128 ll;
const ll x=31;
const ll mod=1000000000000000009;
ll hasz[300010][2];
ll pot[300010];
ll odw[300010];
string s;
ll spr(bool b,int kt){
	if(kt<0||kt>=s.size())return 0;
	return hasz[kt][b];
}
void haszuj(){
	for(int i=0;i<s.size();i++){
		hasz[i][0]=(spr(0,i-1)*x+s[i]-'a'+1)%mod;
		hasz[i][1]=((s[i]-'a'+1)*pot[i]+spr(1,i-1))%mod;
	}
	return;
}
ll ferm(ll xx){
	ll wyn=1,pott=mod-2;
	while(pott){
		if(pott%2)wyn*=xx;
		xx*=xx;
		xx%=mod;
		wyn%=mod;
		pott/=2;
	}
	return wyn;
}
int bs(int a,bool b){
	ll vp=1,vs,vk=s.size(),od=0;
	while(vp<=vk){
		vs=(vp+vk)/2;
		if(a+vs-1>=s.size()||a-vs+(b^1)<0)vk=vs-1;
		else{
			if((hasz[a+vs-1][0]-spr(0,a-vs+(b^1)-1)*pot[vs+vs-(b^1)-1+1])%mod==(((hasz[a+vs-1][1]-spr(1,a-vs+(b^1)-1))*odw[a-vs+(b^1)]))%mod){
				vp=vs+1;
				od=vs;
			}
			else vk=vs-1;
		}
	}
	return od;
}
unordered_map<long long,pair<pair<ll,ll>,ll> >m[2];//klucz - hasz polowy palindromu, parzystosc //// wartosci - glebokosc, ile(suma prefixowa), skad
void upd(int a,int il,bool b){
	int pom=il;
	if(il==0)return;
	while(m[b].find((hasz[a+il-1][0]-spr(0,a-il+(b^1)-1)*pot[il+il-(b^1)-1+1])%mod)==m[b].end()){
		if(il<=1){
			m[b][(hasz[a+il-1][0]-spr(0,a-il+(b^1)-1)*pot[il+il-(b^1)-1+1])%mod]={{1,0},0};
			break;
		}
		il--;
	}
	for(int i=il+1;i<=pom;i++)m[b][(hasz[a+i-1][0]-spr(0,a-i+(b^1)-1)*pot[i+i-(b^1)-1+1])%mod]={{m[b][(hasz[a+i-1-1][0]-spr(0,a-i+1+(b^1)-1)*pot[i-1+i-1-(b^1)-1+1])%mod].first.first+1,0},(hasz[a+i-1-1][0]-spr(0,a-i+1+(b^1)-1)*pot[i-1+i-1-(b^1)-1+1])%mod};
	m[b][(hasz[a+pom-1][0]-spr(0,a-pom+(b^1)-1)*pot[pom+pom-(b^1)-1+1])%mod].first.second++;
	//cout<<b<<' '<<"dodaje\n";
	return;
}
pair<ll,ll>deefes(ll a,bool b){
	ll sum=m[b][a].first.second,wyn=0;
	for(int i='a';i<='z';i++){
		if(m[b].find((a*x+i-'a'+1)%mod)!=m[b].end()){
			pair<ll,ll>p=deefes((a*x+i-'a'+1)%mod,b);
			wyn=max(wyn,p.first);
			sum+=p.second;
		}
	}
	//cout<<b<<' '<<(long long)m[b][a].first.first<<' '<<(long long)sum<<'\n';
	return {max(m[b][a].first.first*sum,wyn),sum};
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
	cin>>s;
	pot[0]=1;
	for(int i=1;i<=s.size();i++)pot[i]=(pot[i-1]*x)%mod;
	odw[s.size()]=ferm(pot[s.size()]);
	for(int i=s.size()-1;i>=0;i--)odw[i]=(odw[i+1]*x)%mod;
	haszuj();
	for(int i=0;i<s.size();i++){
		for(int j=0;j<2;j++){
			int a=bs(i,j);
			upd(i,a,j);
		}
	}
	m[0][0]={{0,0},0};
	m[1][0]={{0,0},0};
	cout<<(long long)max(deefes(0,0).first*2-1,deefes(0,1).first*2);
	return 0;
}

Compilation message (stderr)

palindrome.cpp: In function 'll spr(bool, int)':
palindrome.cpp:12:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |  if(kt<0||kt>=s.size())return 0;
      |           ~~^~~~~~~~~~
palindrome.cpp: In function 'void haszuj()':
palindrome.cpp:16:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |  for(int i=0;i<s.size();i++){
      |              ~^~~~~~~~~
palindrome.cpp: In function 'int main()':
palindrome.cpp:82:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |  for(int i=1;i<=s.size();i++)pot[i]=(pot[i-1]*x)%mod;
      |              ~^~~~~~~~~~
palindrome.cpp:86:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |  for(int i=0;i<s.size();i++){
      |              ~^~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 26
• Subtask 5: 0 / 27