Submission #114225

#TimeUsernameProblemLanguageResultExecution timeMemory
114225dorijanlendvajPalindromes (APIO14_palindrome)C++14
0 / 100
799 ms7900 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #define x first #define y second #define pii pair<int,int> #define pb push_back #define eb emplace_back using namespace std; using namespace __gnu_pbds; typedef long long int ll; typedef unsigned long long int ull; int MOD=1000000007; int MOD2=998244353; vector<int> bases; const ll LLINF=1ll<<60; const char en='\n'; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void yes() {cout<<"YES"<<en; exit(0);} void no() {cout<<"NO"<<en; exit(0);} inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;} template<class T> void prVec(vector<T> w) { cout<<w.size()<<endl; for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' '; if (w.size()) cout<<w[w.size()-1]<<endl; } void M998() { swap(MOD,MOD2); } ll raand() { ll a=rund(); a*=RAND_MAX; a+=rund(); return a; } #define rand raand ll raaand() { return raand()*(MOD-7)+raand(); } string to_upper(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A'; return a; } string to_lower(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A'; return a; } ll sti(string a) { ll k=0; for (int i=0;i<(int)a.size();++i) { k*=10; k+=a[i]-'0'; } return k; } string its(ll k) { if (k==0) return "0"; string a; while (k) { a.push_back((k%10)+'0'); k/=10; } reverse(a.begin(),a.end()); return a; } ll min(ll a,int b) { if (a<b) return a; return b; } ll min(int a,ll b) { if (a<b) return a; return b; } ll max(ll a,int b) { if (a>b) return a; return b; } ll max(int a,ll b) { if (a>b) return a; return b; } ll gcd(ll a,ll b) { if (b==0) return a; return gcd(b,a%b); } ll lcm(ll a,ll b) { return a/gcd(a,b)*b; } template<class T,class K> pair<T,K> mp(T a,K b) { return make_pair(a,b); } inline int mult(ll a,ll b) { return (a*b)%MOD; } inline int pot(int n,int k) { if (k==0) return 1; ll a=pot(n,k/2); a=mult(a,a); if (k%2) return mult(a,n); else return a; } int divide(int a,int b) { return mult(a,pot(b,MOD-2)); } inline int sub(int a,int b) { if (a-b>=0) return a-b; return a-b+MOD; } inline int add(int a,int b) { if (a+b>=MOD) return a+b-MOD; return a+b; } bool prime(ll a) { if (a==1) return 0; for (int i=2;i<=round(sqrt(a));++i) { if (a%i==0) return 0; } return 1; } ll has(string x) { ll h1=0,h2=0; x=to_lower(x); for (char a: x) { h1*=bases[0]; h1+=a-'a'; h1%=bases[3]; h2*=bases[1]; h2+=a-'a'; h2%=bases[4]; } return h1*(MOD+13893829)+h2; } const int N=300010,MAGIC=10; int n,prh1[N],prh2[N],po1[N],po2[N],sufa[N],c[N]; string h; bool use2Hash=0; int dx[]={0,1,0,-1}; int dy[]={1,0,-1,0}; bool equal(int i1,int i2,int l) { int z=prh1[i1+l]-prh1[i2+l]; if (z<0) z+=MOD; bool v1=(z==((po1[l]*1ll*((prh1[i1]-prh1[i2]+MOD)))%MOD)); if (v1 && use2Hash) { return (((prh2[i1+l]-prh2[i2+l]+MOD2)%MOD2)==((po2[l]*1ll*(prh2[i1]-prh2[i2]+MOD2))%MOD2)); } else return v1; } bool cmp(int i,int j) { int lo=0,hi=min(n-j,n-i); if (hi>MAGIC*2 && !equal(i,j,MAGIC)) hi=MAGIC; while (lo<hi) { int mid=(lo+hi+1)/2; if (equal(i,j,mid)) lo=mid; else hi=mid-1; } if (i+lo==n) return 1; if (j+lo==n) return 0; return h[i+lo]<h[j+lo]; } inline int addToHash(int prev,int nex,int ba,int mo) { return (prev*1ll*ba+nex)%mo; } void mysort(int l,int r) { if (l>=r) return; int mid=(l+r)/2; mysort(l,mid); mysort(mid+1,r); //cout<<l<<' '<<mid<<' '<<r<<endl; //for (int i=0;i<n;++i) cout<<sufa[i]<<' '; //cout<<endl; int x=l,y=mid+1,i=0; while (x!=mid+1 && y!=r+1) { if (cmp(sufa[x],sufa[y])) c[i]=sufa[x],++x; else c[i]=sufa[y],++y; ++i; } if (x==mid+1) { while (y!=r+1) c[i]=sufa[y],++y,++i; } else { while (x!=mid+1) c[i]=sufa[x],++x,++i; } for (int i=l;i<=r;++i) sufa[i]=c[i-l]; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829)+13893829); cin>>h; //for (int i=0;i<300000;++i) h.pb(rand()%26+'a'); n=h.size(); for (int i=0;i<n;++i) prh1[i+1]=addToHash(prh1[i],h[i],bases[0],MOD),prh2[i+1]=addToHash(prh2[i],h[i],bases[1],MOD2); po1[0]=po2[0]=1; for (int i=1;i<=n;++i) po1[i]=(po1[i-1]*1ll*bases[0])%MOD,po2[i]=(po2[i-1]*1ll*bases[1])%MOD; for (int i=0;i<n;++i) sufa[i]=i; mysort(0,n-1); //for (int i=0;i<n;++i) cout<<sufa[i]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...