POJ 3087 Shuffle ' m Up (BFS)

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

With BFS written, but in fact is a simulation ah Hello!

Only one operation, how to talk the shortest? Just keep writing down the line.

There's a little doubt that the initial value of the map

Like my definition of map<string,int>d;, what is its initial value? Random values? 0? Or what, Baidu, did not find, seek advice.

/************************************************************************* > File name:code/2015summer/ Searching/gg.cpp > Author:111qqz > Email: [email protected] > Created time:2015 July 24 Friday 23:54 00 seconds ************************************************************************/#include<iostream>#include<iomanip>#include<cstdio>#include<algorithm>#include<cmath>#include<cstring>#include<string>#include<map>#include<Set>#include<queue>#include<vector>#include<stack>#defineY0 ABC111QQZ#defineY1 HUST111QQZ#defineYn hez111qqz#defineJ1 CUTE111QQZ#defineTM CRAZY111QQZ#defineLR DYING111QQZusing namespacestd;#defineREP (i, n) for (int i=0;i<int (n); ++i)typedefLong Longll;typedef unsignedLong LongUll;map<string,int>D;stringSt1,st2,tar;intN;BOOLFlag;stringAddstringAstringb) {    stringres=""; intLen =a.length ();  for(inti =0; i < Len; i++) {res+=B[i]; Res+=A[i]; }    returnRes;}voidBFs () {Queue<string>Q; stringStr=Add (ST1,ST2);    Q.push (str); D[STR]=1;  while(!Q.empty ()) {      stringPST =Q.front ();      Q.pop (); if(pst==tar) {Flag=true; return; }      stringS1=PST.SUBSTR (0, N); stringS2=pst.substr (n,n); stringTmps =Add (S1,S2); if(d[tmps]>0) {flag=false; return; } D[tmps]=d[pst]+1;    Q.push (Tmps); }}intMain () {intT; intCAS =0; CIN>>u;  while(t--) {d.clear (); CAS++; CIN>>N; CIN>>st1>>st2>>tar;      BFS (); if(flag) {cout<<cas<<" "<<d[tar]<<Endl; }      Else{cout<<cas<<" "<<-1<<Endl; }    }      return 0;}

POJ 3087 Shuffle ' m Up (BFS)