POJ 3087 Shuffle'm Up
来源:互联网 发布:linux退出编辑模式 编辑:程序博客网 时间:2024/06/05 02:08
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 containingC 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 fromS2. On top of that chip, is the bottommost chip fromS1. The interleaving process continues taking the 2nd chip from the bottom ofS2 and placing that onS12, followed by the 2nd chip from the bottom ofS1 and so on until the topmost chip fromS1 is placed on top ofS12.
After the shuffle operation, S12 is split into 2 new stacks by taking the bottommostC chips from S12 to form a newS1 and the topmostC chips from S12 to form a newS2. The shuffle operation may then be repeated to form a newS12.
For this problem, you will write a program to determine if a particular resultant stackS12 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 integerC, (1 ≤ C ≤ 100) which is the number of chips in each initial stack (S1 andS2). The second line of each dataset specifies the colors of each of theC chips in stack S1, starting with the bottommost chip. The third line of each dataset specifies the colors of each of theC chips in stack S2 starting with the bottommost chip. Colors are expressed as a single uppercase letter (A throughH). 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 thoughN), 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
#include <cstdio>#include <iostream>#include <algorithm>using namespace std;#include <cstring>#include <map>int main(){ int t; scanf("%d",&t); int num=0; int i,j,k; while(t--) { num++; int c; cin>>c; char s1[1005]; char s2[1005]; char s3[2010]; char s4[4020]; cin>>s1>>s2>>s3; map<string,bool>vis; vis.clear(); vis[s3]=1; int step=0; while(1) { int len=0; for(i=0; i<c; i++) { s4[len++]=s2[i]; s4[len++]=s1[i]; } s4[len]='\0'; step++; if(!strcmp(s4,s3)) { cout<<num<<" "<<step<<endl; break; } if(vis[s4]&&strcmp(s4,s3)) { cout<<num<<" "<<-1<<endl; break; } vis[s4]=1; for(i=0; i<c; i++) s1[i]=s4[i]; s1[i]='\0'; for(j=0; i<c*2; j++,i++) s2[j]=s4[i]; s2[j]='\0'; } } return 0;}
- POJ 3087 Shuffle'm Up
- POJ 3087 Shuffle'm Up
- POJ 3087 Shuffle'm Up
- POJ 3087 Shuffle'm Up
- poj 3087 Shuffle'm Up
- POJ 3087 Shuffle'm Up
- POJ 3087 Shuffle'm Up
- POJ 3087Shuffle'm Up
- poj 3087 Shuffle'm Up
- Shuffle'm Up poj 3087
- POJ 3087 Shuffle'm Up
- POJ 3087 Shuffle'm Up
- poj 3087 Shuffle'm Up
- POJ 3087:Shuffle'm Up
- POJ 3087 Shuffle'm Up
- POJ 3087 Shuffle'm Up
- POJ 3087 Shuffle'm Up
- Shuffle'm Up(POJ--3087
- 适合于图像处理方向的SCI期刊杂志列表【转】
- BIOS+MBR+chameleon 黑苹果安装教程 10.10.5 Yosemite
- ubuntu下如何查找某个文件的路径
- linux 查看系统信息命令(比较全)
- leetcode之Remove Duplicates from Sorted Array
- POJ 3087 Shuffle'm Up
- 写代码要注意的细节
- (NO.00001)iOS游戏SpeedBoy Lite成形记(十)
- 十进制计数器的设计
- Java中特殊字符处理(转义字符)
- AsyncTask简介及使用
- Python3.4对Excel和Word的操作----win32com
- IAR EW6.30版本下建立STM32工程(芯片型号STM32F105VC)
- Spring注解的基础用法