POJ3087--Shuffle'm Up
来源:互联网 发布:c 网络验证源码 编辑:程序博客网 时间:2024/04/29 13:52
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, 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 (S1 and 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
24AHAHHAHAHHAAAAHH3CDECDEEEDDCC
Sample Output
1 22 -1
#include <iostream>#include <cstdio>#include <cstring>#include <string>using namespace std;char A[106],B[106],C[210];char D[210];bool flag;int sum;//如果分成的两堆又恢复了之前的,那么就是不行。不过我觉得我这个做法会超时void bfs(char *a,char *b){sum++;int k=0;for(int i=0;i<strlen(A);i++){D[k++]=b[i];D[k++]=a[i];}D[k]='\0';if(strcmp(D,C)==0){return;}else//底部变S1,顶部变S2{char F[106],G[106];for(int i=0;i<strlen(A);i++){F[i]=D[i];G[i]=D[i+strlen(A)];}F[strlen(A)]='\0';G[strlen(A)]='\0';if(strcmp(F,A)==0&&strcmp(G,B)==0)//是从下到上的{flag=false;return;}else bfs(F,G);}}int main(){int t;scanf("%d",&t);for(int i=1;i<=t;i++){sum=0;flag=true;int len;cin>>len;cin>>A>>B>>C;bfs(A,B);cout<<i<<" ";if(flag)cout<<sum<<endl;else cout<<-1<<endl;}return 0;}
- POJ3087 Shuffle'm Up
- poj3087 Shuffle'm Up
- poj3087 - Shuffle'm Up
- POJ3087 Shuffle'm Up
- POJ3087--Shuffle'm Up
- poj3087 Shuffle'm Up
- POJ3087---Shuffle'm Up
- POJ3087 Shuffle'm Up
- POJ3087-Shuffle'm Up
- poj3087 Shuffle'm Up
- poj3087 Shuffle'm Up
- poj3087 Shuffle'm Up
- poj3087 Shuffle'm Up
- POJ3087-Shuffle'm Up
- poj3087 Shuffle'm Up
- poj3087 Shuffle'm Up 模拟
- POJ3087,Shuffle'm Up,有人说这是bfs...
- POJ3087《Shuffle'm Up》方法:模拟
- 用PHP 通过DOM方式创建一个book.xml文件
- Merkel Tree在BitTorren中的应用
- 正则表达式笔记
- 上班第二周
- vim最基本的命令
- POJ3087--Shuffle'm Up
- linux脚本判断条件总结
- PHP DOS cli 模式运行
- HBase解决Region Server Compact过程占用大量网络出口带宽的问题
- android 代码混淆
- ZOJ 1365 mileage bank
- 创建一个div
- js实现简易计算器
- 推荐阅读:十年学会编程