POJ 3087 Shuffle ' m up

POJ 3087 Shuffle ' m up

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8843		Accepted: 4078

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, on S12 , followed by the 2nd chip from the bottom of S1 and so on until the topmost chip from S1 are 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 newS12.

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

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".

1 /*This simulation can be, pay attention to determine the repeat state, because the rules are certain, if the shuffle of the state of repetition, then it must be washed. 2 It is also important to note that when invoking a string function from the system, the end of the string function must have a ' \ "terminator to be valid. For loop copy of the character array at the end of no ' s ', to fill up3 */4#include <iostream>5 using namespacestd;6#include <cstdio>7 #defineN 2018#include <map>9#include <cstring>Ten inttest; One intMain () A { -scanf"%d",&test); -      for(intI=1; i<=test;++i) the     { -         CharS1[n],s2[n],goals[n]; -         intlen,ans=0; -         BOOLflag=true; +map<string,BOOL>Ma; -scanf"%d%s%s%s",&len,s1,s2,goals); +          while(1) A         { at             CharTemp[n]; -              for(intI=0; i<len;++i) -             { -temp[2*i+1]=S1[i]; -temp[2*i]=S2[i]; -             } intemp[2*len]=' /';// -ans++; to             if(!strcmp (temp,goals)) +             { -                  Break; the             } *             if(Ma[temp]) $             {Panax Notoginsengflag=false; -                  Break; the             } +ma[temp]=true; A              for(intI=0; i<len;++i) the             { +s2[i]=temp[i+Len]; -s1[i]=Temp[i]; $             } $s1[len]=s2[len]=' /'; -         } -         if(flag) theprintf"%d%d\n", I,ans); -         Elseprintf"%d%d\n", i,-1);Wuyi     } the     return 0; -}

POJ 3087 Shuffle ' m up