提交记录 14293


用户 题目 状态 得分 用时 内存 语言 代码长度
lyfer 1006. 【模板题】后缀排序 Wrong Answer 0 8.335 ms 5108 KB C++11 2.19 KB
提交时间 评测时间
2020-09-19 22:49:04 2020-09-19 22:49:08
#pragma GCC optimize("O3")
#pragma G++ optimize("O3")
#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 1000010
using namespace std;
const int BufferSize = 11800000;
char buffer[BufferSize];
char *out_tail = buffer;
inline void putint(int x)
{
	if (!x) *out_tail++ = '0';
	else
	{
		register char s_pool[6], *s_tail = s_pool;
		while (x != 0) *s_tail++ = x % 10 + '0', x /= 10;
		while (s_tail-- != s_pool) *out_tail++ = *s_tail;
	}
	*out_tail++ = ' ';
}
char S[N]; 
int n,m;
int s[N<<1],t[N<<1],H[N],sa[N],r[N],p[N],c[N],w[N];
inline int trans(int n,const char* S){
	int m=*max_element(S+1,S+1+n);
	for(int i=1;i<=n;++i) r[S[i]]=1;
	for(int i=1;i<=m;++i) r[i]+=r[i-1];
	for(int i=1;i<=n;++i) s[i]=r[S[i]];
	return r[m];
}
#define ps(x) sa[w[s[x]]--]=x
#define pl(x) sa[w[s[x]]++]=x
inline void radix(int* v,int* s,int* t,int n,int m,int n1){
	memset(sa,0,n+1<<2); memset(c,0,m+1<<2);
	for(int i=1;i<=n;++i) ++c[s[i]];
	for(int i=1;i<=m;++i) c[i]+=c[i-1];
	for(int i=1;i<=m;++i) w[i]=c[i];
	for(int i=n1;i;--i) ps(v[i]);
	for(int i=1;i<=m;++i) w[i]=c[i-1]+1;
	for(int i=1;i<=n;++i) if(sa[i]>1 && t[sa[i]-1]) pl(sa[i]-1);
	for(int i=1;i<=m;++i) w[i]=c[i];
	for(int i=n;i;--i) if(sa[i]>1 && !t[sa[i]-1]) ps(sa[i]-1);
}
inline void SAIS(int n,int m,int* s,int* t,int* p){
	int n1=0,ch=r[1]=0,*s1=s+n; t[n]=0;
	for(int i=n-1;i;--i) t[i]=s[i]==s[i+1]?t[i+1]:s[i]>s[i+1];
	for(int i=2;i<=n;++i) r[i]=t[i-1]&&!t[i]?(p[++n1]=i,n1):0;
	radix(p,s,t,n,m,n1);
	for(int i=1,x,y;i<=n;++i) if(x=r[sa[i]]){
		if(ch<=1 || p[x+1]-p[x]!=p[y+1]-p[y]) ++ch;
		else for(int j=p[x],k=p[y];j<=p[x+1];++j,++k)
			if((s[j]<<1|t[j])^(s[k]<<1|t[k])){ ++ch; break; }
		s1[y=x]=ch;
	}
	if(ch<n1) SAIS(n1,ch,s1,t+n,p+n1);
	else for(int i=1;i<=n1;++i) sa[s1[i]]=i;
	for(int i=1;i<=n1;++i) s1[i]=p[sa[i]];
	radix(s1,s,t,n,m,n1);
}
inline void SA(int n,const char* S){
	int m=trans(++n,S);	SAIS(n,m,s,t,p);
	for(int i=1;i<n;++i) r[sa[i]=sa[i+1]]=i;
	for(int i=1,j,k=0;i<n;++i) if(r[i]>1){
		for(j=sa[r[i]-1];S[i+k]==S[j+k];++k);
		if(H[r[i]]=k) --k;
	}
}
int main(){
	gets(S+1); n=strlen(S+1); SA(n,S);
	for (int i = 1; i <= n; ++i) putint(sa[i]);
	*out_tail++ = '\n';
	for (int i = 2; i <= n; ++i)  putint(H[i]);
	fwrite(buffer, 1, out_tail - buffer, stdout);
}

CompilationN/AN/ACompile OKScore: N/A

Subtask #1 Testcase #19.93 us56 KBWrong AnswerScore: -100

Subtask #1 Testcase #212.17 us56 KBAcceptedScore: 100

Subtask #1 Testcase #312.38 us56 KBAcceptedScore: 0

Subtask #1 Testcase #410.88 us56 KBAcceptedScore: 0

Subtask #1 Testcase #510.38 us56 KBAcceptedScore: 0

Subtask #1 Testcase #611.24 us56 KBAcceptedScore: 0

Subtask #1 Testcase #77.196 ms4 MB + 204 KBAcceptedScore: 0

Subtask #1 Testcase #88.335 ms4 MB + 380 KBAcceptedScore: 0

Subtask #1 Testcase #98.175 ms4 MB + 164 KBAcceptedScore: 0

Subtask #1 Testcase #105.211 ms2 MB + 736 KBAcceptedScore: 0

Subtask #1 Testcase #115.151 ms2 MB + 776 KBAcceptedScore: 0

Subtask #1 Testcase #125.239 ms4 MB + 312 KBAcceptedScore: 0

Subtask #1 Testcase #135.161 ms4 MB + 248 KBAcceptedScore: 0

Subtask #1 Testcase #145.207 ms3 MB + 868 KBAcceptedScore: 0

Subtask #1 Testcase #155.198 ms3 MB + 928 KBAcceptedScore: 0

Subtask #1 Testcase #165.623 ms4 MB + 900 KBAcceptedScore: 0

Subtask #1 Testcase #175.597 ms4 MB + 1012 KBAcceptedScore: 0

Subtask #1 Testcase #185.499 ms4 MB + 984 KBAcceptedScore: 0


Judge Duck Online | 评测鸭在线
Server Time: 2026-03-22 19:48:31 | Loaded in 1 ms | Server Status
个人娱乐项目,仅供学习交流使用 | 捐赠