G - Shuffle’m Up
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u
Submit
Status
Practice
POJ 3087
Appoint description:
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
题意:首行给出T,代表有T组数据。每组数据第一行给出len,接下来两行给出长度为len的两个字符串,str_1,str_2,再接着一行给出长度为len*2的目标字符串str。按照str_2[i]在下str_1[i]在上的规则生成新的长度为len*2的str,如果str和目标字符串相同,就输出用了多少步,否则把新的str前len部分拆成str_1,后len部分拆成str_2,然后接着拼接变换。如果不可能变换成目标字符串输出-1.
思路:变换的部分纯属模拟,map,set都可以,strcmp,strcpy也行。每次变换要记录生成的str_1和str_2,如果出现过了,说明进入了环,直接输出-1.
代码
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<queue>
#include<math.h>
using namespace std;
char map_1[1005][105];//存储出现过的字符串
char map_2[1005][105];
int main()
{
int T;
scanf("%d",&T);
for(int casen=1; casen<=T; casen++)
{
int len;
scanf("%d",&len);//单个字符串长度
char str_1[105];
char str_2[105];
char str_12[205];
char str[205];//目标字符串
scanf("%s%s%s",str_1,str_2,str_12);
strcpy(str,str_12);//目标字符串存到str
int steap=0;//需要多少步才能完成
while(1)
{
strcpy(map_1[steap],str_1);
strcpy(map_2[steap],str_2);//存储出现过的字符串
for(int i=0,j=0; i<len; i++)
{
str_12[j++]=str_2[i];
str_12[j++]=str_1[i];//获取拼接出来的字符串
}
steap++;//拼接操作次数加一
if(strcmp(str,str_12)==0)
{
printf("%d ",casen);
printf("%d\n",steap);
break;//拼接出来的字符串和目标字符串相等
}
for(int i=0; i<len; i++)
str_1[i]=str_12[i];//获取新的字符串1
for(int i=len,j=0; i<len*2; i++,j++)
str_2[j]=str_12[i];//获取新的字符串2
bool is_break=0;//需要时就置为1
for(int i=0; i<steap; i++)//检测新的字符串1是否出现过
if(strcmp(map_1[i],str_1)==0)
{
printf("%d ",casen);
printf("-1\n");
is_break=1;
break;
}
if(is_break==1)
break;
for(int i=0; i<steap; i++)//检测新的字符串2是否出现过
if(strcmp(map_2[i],str_2)==0)
{
printf("%d ",casen);
printf("-1\n");
is_break=1;
break;
}
if(is_break==1)
break;
}
}
return 0;
}