Shuffle'm UpTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Description
A common pastime for poker players at a poker table is to shuffle stacks of chips. Shuffling chips is performed by starting with two stacks of poker chips, S1 and S2, each stack containing C chips. Each stack may contain chips of several different colors.
The actual shuffle operation is performed by interleaving a chip from S1 with a chip from S2 as shown below for C = 5:
The single resultant stack, S12, contains 2 * C chips. The bottommost chip of S12 is the bottommost chip from S2. On top of that chip, is the bottommost chip from S1. The interleaving process continues taking the 2nd chip from the bottom of S2 and placing that on S12, followed by the 2nd chip from the bottom of S1 and so on until the topmost chip from S1 is placed on top of S12.
After the shuffle operation, S12 is split into 2 new stacks by taking the bottommost C chips from S12 to form a new S1 and the topmost C chips from S12 to form a new S2. The shuffle operation may then be repeated to form a new S12.
For this problem, you will write a program to determine if a particular resultant stack S12 can be formed by shuffling two stacks some number of times.
Input
The first line of input contains a single integer N, (1 ≤ N ≤ 1000) which is the number of datasets that follow.
Each dataset consists of four lines of input. The first line of a dataset specifies an integer C, (1 ≤ C ≤ 100) which is the number of chips in each initial stack (S1 and S2). The second line of each dataset specifies the colors of each of the C chips in stack S1, starting with the bottommost chip. The third line of each dataset specifies the colors of each of the C chips in stack S2 starting with the bottommost chip. Colors are expressed as a single uppercase letter (A through H). There are no blanks or separators between the chip colors. The fourth line of each dataset contains 2 * C uppercase letters (A through H), representing the colors of the desired result of the shuffling of S1 and S2 zero or more times. The bottommost chip’s color is specified first.
Output
Output for each dataset consists of a single line that displays the dataset number (1 though N), a space, and an integer value which is the minimum number of shuffle operations required to get the desired resultant stack. If the desired result can not be reached using the input for the dataset, display the value negative 1 (−1) for the number of shuffle operations.
Sample Input
2
4
AHAH
HAHA
HHAAAAHH
3
CDE
CDE
EEDDCC
Sample Output
1 2
2 -1
模拟洗牌的过程,将两堆合并为1堆,再拆成两堆,再合并,如此往复,问合成的那一堆的牌有没有可能出现题目给出的序列,既然要判断字串,那必须KMP,主串就是最终合并的那个串,字串则是题目中给出的,个人建议,KMP在传值的时候只传字符串就好,,其他的如果不重要就不要传了我就是把长度什么的一股脑的传过去,结果许多变量重名,降低了程序的可读性。
洗牌的过程也比较简单,主串指针以此向后走,分别传入s2和s1的相应值,最后再把主串拆开,理论上来说,洗牌的过程可以永远进行下去,但我们可以定一个上限,我定义的就是1000次,超过就说明不可能了,我觉得,洗牌的次数超过一个值得时候应该就回到起点了,但这只是一个猜测哈
#include <iostream>
#include <cmath>
#include <stdio.h>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <algorithm>
#include <memory.h>
#define MAX 300
using namespace std;
char s1[MAX],s2[MAX],s[MAX<<1];//s主串
void getNext(char *str,int *next,int len)
{
int j=0,k=-1;
next[0]=-1;
while(j<len)
{
if(k==-1||str[j]==str[k])
{
k++;
j++;
if(str[j]!=str[k])
next[j]=k;
else
next[j]=next[k];
}
k=next[k];
}
}
bool kmp(char *str)
{
int i=0,j=0;
int len=strlen(s);//len主串长度
int s_len=strlen(str);//模式串长度
int next[MAX];
getNext(str,next,s_len);
while(i<len&&j<s_len)
{
if(j==-1||s[i]==str[j])
{
i++;
j++;
}
else
j=next[j];
}
if(j>=s_len)
return true;
return false;
}
int op(char *str,int len)
{
int p;
int i,j=0;
while(j<1000)
{
j++;
p=0;
for(i=0;i<len;i++)//洗牌
{
s[p++]=s2[i];
s[p++]=s1[i];
}
s[p]='\0';
if(kmp(str))//判断
{
return j;
break;
}
p=0;
for(i=0;i<len;i++)//拆牌
{
s1[p++]=s[i];
}
s1[p]='\0';
p=0;
for(;i<2*len;i++)//拆牌
{
s2[p++]=s[i];
}
s2[p]='\0';
}
return -1;
}
int main()
{
int cas,c,len;//每一堆的数量
char str[MAX];//模式串
cin>>cas;
for(c=1;c<=cas;c++)
{
cin>>len>>s1>>s2>>str;
cout<<c<<' '<<op(str,len)<<endl;
}
return 0;
}