POJ 3087 Shuffle
题目描述
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
大致题意
给你两堆高度为c的牌堆和一个目标牌堆(将两副牌洗到一起),你能将两个牌堆洗在一起,然后再分成两个牌堆,问能否达到目标牌堆和需要的最少操作次数。比如 s1:CBA 和 s2:FED ,洗完一次变成s3:FCEBDA ,分成两个牌堆 s1:FCE 和s2:BDA.
思路
简单模拟,一直洗牌再分牌,直到符合目标牌堆或者回到初始状态。
代码如下
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include<sstream>
#include<ctime>
using namespace std;
char s1[105],s2[105],s3[210],t1[105],t2[105],t3[210];
int main()
{
int T,c;
cin>>T;
for(int k=1;k<=T;k++)
{
cin>>c;
getchar();
gets(s1);
gets(s2);
gets(s3);
strcpy(t1,s1);// 辅助数组
strcpy(t2,s2);
strcpy(t3,s3);
int step=0,flag=0; //初始化
while(1)
{
step++; //一次操作
for(int i=0,j=0;j<c;j++) //洗牌
{
t3[i]=t2[j];
t3[i+1]=t1[j];
i+=2;
}
if(strcmp(s3,t3)==0) //比较是否和目标相同,如果相同则将flag标记为1,结束
{
flag=1;
break;
}
for(int i=0;i<c;i++) //分牌
t1[i]=t3[i];
for(int i=c;i<2*c;i++)
t2[i-c]=t3[i];
if(strcmp(s1,t1)==0&&strcmp(s2,t2)==0) //如果回到初始牌,则结束
break;
}
if(flag==1) // 有解
cout<<k<<' '<<step<<endl;
else //无解
cout<<k<<' '<<-1<<endl;
}
return 0;
}