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
大致题意
两副牌s1,s2,按着合并规则合成s3,是否和s12一样,若一样问洗牌几次,不一样则继续洗牌,如果达不到s12则输出-1,洗牌规则:下面一半为s1,上面一半s2
这里牌中的底部指是s[0]
具体思路
其实就是一个大模拟水题,途中关键是判断是不是洗不出我们要的牌,洗牌规则单一,在洗牌无限次的基础上会形成一个周期循环,我们只要判断洗过后的牌是否之前已经出现过即可,这里用map去映射便可以达到目的
#include<stdio.h>
#include<string.h>
#include<map>
#include<iostream>
using namespace std;
typedef long long int LLD;
int main()
{
LLD t;
scanf("%lld",&t);
for (LLD i=1; i<=t; i++)
{
map<string,LLD>Map;
Map.clear();
LLD c;
char s1[105],s2[105],s12[205],s3[205];
scanf("%lld%*c",&c);
scanf("%s*c",&s1);
scanf("%s*c",&s2);
scanf("%s*c",&s12);
for (LLD j=0; j<c; j++)
{
s3[j*2]=s2[j];
s3[j*2+1]=s1[j];
}
s3[c*2]='\0';
strncpy(s1,s3,c);
strncpy(s2,s3+c,c);
LLD ans=1;
while (1)
{
if (strcmp(s3,s12)==0)
{
printf("%lld %lld\n",i,ans);
break;
}
if (Map[s3]==1)
{
printf("%lld -1\n",i);
break;
}
else
{
Map[s3]=1;
ans++;
for (LLD j=0; j<c; j++)
{
s3[j*2]=s2[j];
s3[j*2+1]=s1[j];
}
s3[c*2]='\0';
strncpy(s1,s3,c);
strncpy(s2,s3+c,c);
}
}
}
return 0;
}