POJ 3087 Shuffle ' m up

Shuffle ' m upTime limit:1000MS Memory Limit:65536KB 64bit IO Format:%i64d &%i64 U SubmitStatusPracticePOJ 3087

Description

A common pastime for poker players at a poker table was to shuffle stacks of chips. Shuffling chips is performed by starting with the stacks of poker chips, S1 and S2, each stack containin G C chips. Each of the stacks 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 being Low 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 this chip, is the bottommost chip from  S1 . The interleaving process continues taking the 2nd chip from the bottom of  S2  and placing t Hat on  S12 , followed by the 2nd chip from the bottom of  S1  and so O n until the topmost chip from  S1  is placed on top of  S12 .

After the shuffle operation, S12 are split into 2 new stacks by taking the bottommost C chips from S1 2 to form a new S1 and the topmost C chips from S12 to form a new S2. The shuffle operation is repeated to form a new S12.

For the problem, you'll write a program to determine if a particular resultant stack S12 can be formed by sh Uffling 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 datasets specifies an integerC, (1≤C≤100) which is the number of chips in each initial stack (S1andS2). The second line of each dataset specifies the colors of theCChips in StackS1, starting with the bottommost chip. The third line of each dataset specifies the colors of theCChips in StackS2Starting with the bottommost chip. Colors is expressed as a single uppercase letter (AThroughH). There is no blanks or separators between the chip colors. The fourth line of each dataset contains 2 *CUppercase Letters (AThroughH), representing the colors of the desired result of the shuffling ofS1andS2zero or more times. The bottommost chip ' s color is specified first.

Output

Output for each dataset consists of a displays the dataset number (1 though N), a space, and an The integer value which is the minimum number of shuffle operations required to get the desired resultant stack. If the desired result can is reached using the input for the dataset, display the value negative 1 (−1) for T He number of shuffle operations.

Sample Input

24ahahhahahhaaaahh3cdecdeeeddcc

Sample Output

1 22-1


Note: My English is very slag, the topic is mostly from Baidu ~=0=

Main topic:

Known two stacks of cards S1 and S2 of the initial state, the number of cards are C, according to the given rules can be cross-assembled into a pile of cards s12, and then s12 of the bottom of the C-block card to S1, the top of the C-block card is S2, according to this cycle down.

Now enter the initial state of S1 and S2 and the expected final State S12

Ask S1 S2 after how many times shuffle, finally can reach the state s12, if never the same, then output "1".

Input:

2//has two test samples 4//each stack has several ahah//s1haha//s2hhaaaahh//needed to reach the status 3CDECDEEEDDCC
Output

1 2//required output number of samples the first few times shuffle up to the required 2-1

Originally was classified to the wide search, on the internet to see the great God with the simulation on their way to try to write the next very happy a dropped

Here is the code

#include <iostream>#include<cstdio>#include<cstring>#include<queue>#include<cstdlib>#include<cmath>#include<cctype>#defineN 210using namespacestd;structnode{CharS[n]; structNode *next;}*head, *last, *Q;intMain () {intc, sample, ans, T, I; CharS1[n], S2[n], str[n], temp[n];//S1, s2 number of cards, STR needs to reach the state, temp is used to save the state after each shufflescanf"%d", &T);  for(sample =1; Sample <= T; sample++)//Output will need to output a few examples, sample to save{scanf ("%d %s%s%s", &c, S1, S2, str); Head= (node *)malloc(sizeof(node)); Head->next =NULL; Last=Head; Ans=0;  while(1)        {            ++ans;  for(i =0; I < C; i++) {temp[2* I] =S2[i]; temp[2* i +1] =S1[i]; } temp[2* I] =' /'; if(!STRCMP (temp, str))//have gotten the desired state{printf ("%d%d\n", sample, ans);  Break; }            BOOLFlag =false; Q=Head;  while(Q->next! = NULL) {//Find out if this state has ever occurred                if(!STRCMP (q->S, temp)) {Flag=true;  Break; } q= q->Next; }            if(flag) {//state recurs, not up to the desired stateprintf"%d-1\n", sample);  Break; } q= (node *)malloc(sizeof(node)); strcpy (q-s, temp); Last->next =Q; Last=Q; Q->next=NULL;  for(i =0; I < C; i++) {S1[i]=Temp[i]; S2[i]= Temp[i +c]; }        }    }}

POJ 3087 Shuffle ' m up