G - Shuffle'm Up POJ - 3087(string+BFS模拟题意)
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 (S1and 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
题意:洗扑克牌,洗完一次后分为上半部分s1,下半部分s2,继续洗牌。问能不能得到指定序列。
思路:用string+dfs模拟题意并不难,但有一个地方不好想,如何判断扑克牌能不能得到目标序列,如果不能的到dfs一直调用下去就死循环了,我第一次想到的是加一个计数器,当dfs100次后自动结束,但ruintime error了,比较好的做法是用map测试是否重复了,详情见代码。后来想了想这样最坏情况可能会把所有情况都便利一遍,不算很好。
代码:
//Full of love and hope for life
#include <iostream>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdio.h>
#include <queue>
#include <map>
using namespace std;
string s1,s2,ss,s;
int a,b,k,t;
map<string,int>ma;
int dfs()
{
s="";//初始化
for(int i=0;i<b;i++)
{
s+=s2[i];
s+=s1[i];
}
t++;
ma[s]++;
if(s==ss)
{
return t;
}
if(ma[s]>1)//若字符串与上一个字符串一样,则直接回-1
{
return-1;
}
s1="";//初始化
s2="";//初始化
for(int i=0;i<b;i++)
{
s1+=s[i];
}
for(int i=b;i<2*b;i++)
{
s2+=s[i];
}
dfs();//继续变化
}
int main()
{
k=0;
cin >> a;
while(a--)
{
t=0;
k++;
cin >> b;
cin >> s1 >> s2 >> ss;
cout << k << " " << dfs() << endl;
}
return 0;
}