poj 3087 Shuffle'm Up

Shuffle'm Up

Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9562 Accepted: 4402

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, S₁ and S₂, 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 S₁ with a chip from S₂ as shown below for C = 5:

The single resultant stack, S₁₂, contains 2 * C chips. The bottommost chip of S₁₂ is the bottommost chip from S₂. On top of that chip, is the bottommost chip from S₁. The interleaving process continues taking the 2^nd chip from the bottom of S₂ and placing that on S₁₂, followed by the 2^nd chip from the bottom of S₁ and so on until the topmost chip from S₁ is placed on top of S₁₂.

After the shuffle operation, S₁₂ is split into 2 new stacks by taking the bottommost C chips from S₁₂ to form a new S₁ and the topmost C chips from S₁₂ to form a new S₂. The shuffle operation may then be repeated to form a new S₁₂.

For this problem, you will write a program to determine if a particular resultant stack S₁₂ 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 (S₁ and S₂). The second line of each dataset specifies the colors of each of the C chips in stack S₁, starting with the bottommost chip. The third line of each dataset specifies the colors of each of the C chips in stack S₂ 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 S₁ and S₂ 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

24AHAHHAHAHHAAAAHH3CDECDEEEDDCC

Sample Output

1 22 -1

Source

/*

我们将s2第一个字符放在头上，之后s1第一个字符放上去，接着到s2的第二个字符。。。。。。放完以后看和不和s12相同，不同把s12下面那一半给s1，另外的给s2，如果相同输出相同时的最少洗牌次数，不可能相同的话输出“-1”。

*/

就是一个模拟题，不过不知道是谁把它归为了广搜题上，那就用广搜的办法做吧！！！

不可能相同的时候就是题目进入了循环之中，，

代码如下：

Memory: 596KTime: 0MSLanguage: G++Result: AcceptedSource Code#include <string.h>#include <stdio.h>#include <algorithm>#include <queue>using namespace std;struct node{    char c[102];    char d[102];    int step;};int n, m;queue<node> q;char ch2[102], ch1[102];char ch[204], mo[204], str[204];int bfs(){    int i;    while ( !q.empty() )    {        q.pop();    }    node temp;    int flag = 0;                                   //这里需要注释一下，这样做主要是为了找循环    strcpy(temp.c, ch1);    strcpy(temp.d, ch2);    temp.step = 1;    q.push(temp);    while ( !q.empty() )    {        node tail, head;        head = q.front();        q.pop();        int j = 0;        for ( i = 0;i < n; i++ )        {            mo[j++] = head.d[i];            mo[j++] = head.c[i];        }        mo[j] = '\0';        if (flag == 0)        {            strcpy( str, mo );            flag = 1;                           //保存第一次的数据        }        if ( strcmp(mo, ch) == 0)        {            return head.step;        }        else if ( strcmp(mo, str) == 0 &&flag == 2)        {            return -1;        }        else        {            for ( i = 0; i < n; i++ )            {                tail.c[i] = mo[i];            }            tail.c[i] = '\0';            for (j = 0;j < n; j++ )            {                tail.d[j] = mo[i++];            }            tail.d[j] = '\0';            tail.step = head.step+1;            q.push(tail);        }        flag = 2;                                     //第一次过后就开始比较是否是进入了循环之中    }    return -1;}int main(){    int t;    scanf ( "%d", &t );    int cnt = 1;    while ( t-- )    {        scanf ( "%d", &n );        scanf ( "%s %s", ch1, ch2 );        scanf ( "%s", ch );        int sum = bfs();        printf ( "%d %d\n", cnt, sum );        cnt++;    }}

代码菜鸟，如有错误，请多包涵！！！

如果有帮助记得支持我一下，谢谢！！！