Submission #855988

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
#include <cassert>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
string str;
int n,k;
int ran[500005];
int tmp[500005];
int sa[500005];

bool compare_sa(int i,int j)
{
	if(ran[i] != ran[j]) return ran[i] < ran[j];
	else
	{
		int ri = i+k<=n ? ran[i+k]: -1;
		int rj = j+k<=n ? ran[j+k]: -1;
		
		return ri < rj;
	}
}

void constuct_sa(string S)
{
	for(int i=0;i<=n;i++)
	{
		sa[i] = i;
		ran[i] = i<n?S[i]:-1;
	}
	
	for(k=1;k<=n;k*=2)
	{
		sort(sa,sa+n+1,compare_sa);
		
		tmp[sa[0]] = 0;
		for(int i=1;i<=n;i++)
		{
			tmp[sa[i]] = tmp[sa[i-1]] + compare_sa(sa[i-1],sa[i]);
		}
		for(int i=0;i<=n;i++)
		{
			ran[i] = tmp[i];
		}
	}
}
int lcp[500005];
void construct_lcp(string S)
{
	int n = S.size();
	for(int i=0;i<=n;i++) ran[sa[i]] = i;
	
	int h = 0;
	lcp[0] = 0;
	
	for(int i=0;i<n;i++)
	{
		int j = sa[ran[i]-1];
		
		if(h) h--;
		for(;j+h<n && i+h<n;h++)
		{
			if(S[j+h] != S[i+h]) break;
		}
		lcp[ran[i]-1] = h;
	}
}
int seg[(1<<20)];
void update(int k,int a){
	k+=(1<<19)-1; seg[k]=a;
	while(k>0){
		k=(k-1)/2;
		seg[k]=min(seg[k*2+1],seg[k*2+2]);
	}
}
int query(int a,int b,int k,int l,int r){
	if(r<a || b<l) return INF;
	if(a<=l && r<=b) return seg[k];
	else{
		int vl=query(a,b,k*2+1,l,(l+r)/2);
		int vr=query(a,b,k*2+2,(l+r)/2+1,r);
		return min(vl,vr);
	}
}
vector<int>divb[500005];
int main(){
	cin >> str; n = str.size();
	constuct_sa(str); construct_lcp(str);
	bool as = 0,rep = 0;
	for(int i=1;i<n;i++){
		if(n%i != 0) continue;
		for(int j=0;j<i;j++){
			char cur = str[j];
			for(int k=j+i;k<n;k+=i){
				if(cur != str[k]) goto bad;
			}
		}
		rep = 1; if(i==1) as = 1; bad:;
	}
	for(int i=1;i<=500000;i++){
		for(int j=i+i;j<=500000;j+=i){
			divb[j].pb(i);
		}
	}
	if(as){
		cout << n << endl << 1 << endl; return 0;
	}
	if(!rep){
		cout << 1 << endl << 1 << endl; return 0;
	}
	for(int i=0;i<n;i++){
		update(i,lcp[i]);
	}
	
	{
		cout << 2 << endl;
		int ret = 0;
		for(int i=1;i<=n-1;i++){
			//pre=i back=n-i
			for(int j=0;j<divb[i].size();j++){
				int a = ran[0];
				int b = ran[divb[i][j]];
				if(a > b) swap(a,b);
				
				if(query(a,b-1,0,0,(1<<19)-1) >= i-divb[i][j]){
					goto bad1;
				}
			}
			for(int j=0;j<divb[n-i].size();j++){
				int a = ran[i];
				int b = ran[i+divb[n-i][j]];
				if(a > b) swap(a,b);
				
				if(query(a,b-1,0,0,(1<<19)-1) >= n-i-divb[n-i][j]){
					goto bad1;
				}
			}
			ret++; bad1:;
		}
		assert(ret) ; cout << ret << endl;
	}
}

Submission Info

Judge Result