hdu5558 Alice's Classified Message
2015-11-14 22:24
477 查看
Alice's Classified Message
Time Limit: 16000/8000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 33 Accepted Submission(s): 11
Problem Description
Alice wants to send a classified message to Bob. She tries to encrypt the message with her original encryption method. The message is a string S,
which consists of N lowercase
letters.
S[a…b] means
a substring of S ranging from S[a] to S (0≤a≤b<N).
If the first i letters
have been encrypted, Alice will try to find a magic string P.
Assuming P has K letters, P is
the longest string which satisfies P=S[T...T+K−1] (0≤T<i,T+K≤N)
and P=S[i…i+K−1](i+K≤N).
In other words, P is
a substring of S,
of which starting address is within [0...i−1],
and P is
also a prefix of S[i...N−1].
If P exists,
Alice will append integer K and T to
ciphertext. If T is
not unique, Alice would select the minimal one. And then i is
incremented by K.
If P does
not exist, Alice will append -1 and the ASCII code of letter S[i] to
ciphertext, and then increment i by
1.
Obviously the first letter cannot be encrypted. That is to say, P does
not exist when i=0.
So the first integer of ciphertext must be -1, and the second integer is the ASCII code of S[0].
When i=N,
all letters are encrypted, and Alice gets the final ciphertext, which consists of many pairs of integers. Please help Alice to implement this method.
Input
The first line of input contains an integer T,
which represents the number of test cases (T≤50).
Each test case contains a line of string, which has no more than 100000 lowercase letters. It is guaranteed that the total length of the strings is not greater than 2×106.
Output
For each test case, output a single line consisting of “[b]Case #X:” first. X is
the test case number starting from 1. Output the ciphertext in the following lines. Each line contains two integers separated by a single space.
Sample Input
2
aaaaaa
aaaaabbbbbaaabbc
Sample Output
Case #1:
-1 97
5 0
Case #2:
-1 97
4 0
-1 98
4 5
5 2
-1 99
Source
2015ACM/ICPC亚洲区合肥站-重现赛(感谢中科大)
Recommend
wange2014 | We have carefully selected several similar problems for you: 5566 5565 5564 5563 5562
这题子串与子串相匹配,八成是后缀数组,那么我们先求出height数组,但题目要求一个串必须从i开始,另一个串必须在i之前开始,那么,我们就可以在后缀排序之后的字符串集中,从i串向前二分查找最近的在i串之前的串,从i串向后二分查找最近的在i串之前的串,那么我们就知道一个答案了,另一个答案要求序号最小,我们可以向前向后二分查找满足答案的最远串,最后求两个最远串之间的序号最小的串,复杂度O(nlogn)常数较大,不知道排名第一的代码怎么写的。
#include<cstdlib> #include<cstdio> #include<cstring> #include<cmath> #include<iostream> #include<algorithm> using namespace std; int n; const int maxn=110000; struct Suffix{ Suffix(){} char s[maxn];int rk[maxn],h[maxn],c[maxn],t[maxn],sa[maxn]; void build(){ int *x=t,*sa2=rk,m=200; for(int i=0;i<m;i++)c[i]=0; for(int i=0;i<n;i++)c[x[i]=s[i]]++; for(int i=1;i<m;i++)c[i]+=c[i-1]; for(int i=n-1;i>=0;i--)sa[--c[x[i]]]=i; for(int k=1;k<=n;k<<=1){ int p=0; for(int i=n-k;i<n;i++)sa2[p++]=i; for(int i=0;i<n;i++)if(sa[i]>=k)sa2[p++]=sa[i]-k; for(int i=0;i<m;i++)c[i]=0; for(int i=0;i<n;i++)c[x[sa2[i]]]++; for(int i=1;i<m;i++)c[i]+=c[i-1]; for(int i=n-1;i>=0;i--)sa[--c[x[sa2[i]]]]=sa2[i]; swap(x,sa2); p=1;x[sa[0]]=0; for(int i=1;i<n;i++) x[sa[i]]=sa2[sa[i-1]]==sa2[sa[i]]&&sa2[sa[i-1]+k]==sa2[sa[i]+k]?p-1:p++; if(p>=n)break; m=p; } } int rank[maxn]; void calheignt(){ int k=0; for(int i=0;i<n;i++)rank[sa[i]]=i;h[0]=0; for(int i=0;i<n-1;i++){ if(k)k--; int j=sa[rank[i]-1]; while(s[i+k]==s[j+k])k++; h[rank[i]]=k; } } int _st[maxn][20],pow2[20],n_st[maxn][20]; void st_build(){ pow2[0]=1;for(int i=1;i<=19;i++)pow2[i]=pow2[i-1]*2; for(int i=n-1;i>=0;i--){ _st[i][0]=h[i];n_st[i][0]=sa[i]; for(int j=1,k=1;2*j+i-1<n;j<<=1,k++){ _st[i][k]=min(_st[i][k-1],_st[i+j][k-1]); n_st[i][k]=min(n_st[i][k-1],n_st[i+j][k-1]); } } } int st_query(int l,int r){ int k=(int)log2(r-l+1); return min(_st[l][k],_st[r-pow2[k]+1][k]);; } int n_st_query(int l,int r){ int k=(int)log2(r-l+1); return min(n_st[l][k],n_st[r-pow2[k]+1][k]); } }S; int queryl(int x){ int l=1,r=x-1; while(l<=r){ int mid=(l+r)>>1; if(S.n_st_query(mid,x-1)<S.sa[x])l=mid+1; else r=mid-1; } return l-1; } int queryr(int x){ int l=x+1,r=n-1; while(l<=r){ int mid=(l+r)>>1; if(S.n_st_query(x+1,mid)<S.sa[x])r=mid-1; else l=mid+1; } return l; } int queryll(int x,int v){ int l=1,r=x-1; while(l<=r){ int mid=(l+r)>>1; if(S.st_query(mid+1,x)<v)l=mid+1; else r=mid-1; } return r+1; } int queryrr(int x,int v){ int l=x+1,r=n-1; while(l<=r){ int mid=(l+r)>>1; if(S.st_query(x+1,mid)<v)r=mid-1; else l=mid+1; } return l-1; } void work(int no){ printf("Case #%d:\n",no); scanf("%s",S.s);n=strlen(S.s);S.s ='@';n++; printf("-1 %d\n",S.s[0]); S.build(); S.calheignt(); S.st_build(); for(int i=1;i<n-1;){ i=S.rank[i]; int l=queryl(i); int x=0; if(l>0)x=S.st_query(l+1,i); int r=queryr(i); int y=0; if(r<n)y=S.st_query(i+1,r); if(y>x){ int c=queryrr(i,y); int z=S.n_st_query(i,c); printf("%d %d\n",y,z); i=S.sa[i];i+=y; }else if(y<x){ int c=queryll(i,x); int z=S.n_st_query(c,i); printf("%d %d\n",x,z); i=S.sa[i];i+=x; }else if(y==x){ if(x==0){ i=S.sa[i]; printf("-1 %d\n",S.s[i]); i++; }else{ int c=queryll(i,y); int z=S.n_st_query(c,i); c=queryrr(i,x); z=min(z,S.n_st_query(i,c)); printf("%d %d\n",x,z); i=S.sa[i];i+=x; } } } } int main(){ int t;scanf("%d",&t); for(int i=1;i<=t;i++)work(i); return 0; }
相关文章推荐
- 解析从源码分析常见的基于Array的数据结构动态扩容机制的详解
- javascript数组操作总结和属性、方法介绍
- mysql_fetch_assoc和mysql_fetch_row的功能加起来就是mysql_fetch_array
- JavaScript Array扩展实现代码
- JavaScript之数组(Array)详解
- C#中Array与ArrayList用法及转换的方法
- Array栈方法和队列方法的特点说明
- Array.prototype.slice 使用扩展
- Array, Array Constructor, for in loop, typeof, instanceOf
- 实例详解ECMAScript5中新增的Array方法
- js Array的用法总结
- JavaScript 判断判断某个对象是Object还是一个Array
- Javascript中的Array数组对象详谈
- js模拟实现Array的sort方法
- 在javascript将NodeList作为Array数组处理的方法
- PHP array_multisort()函数的使用札记
- PHP中array_merge和array相加的区别分析
- Sorting Array Values in PHP(数组排序)
- 深入array multisort排序原理的详解
- Array 重排序方法和操作方法的简单实例