poj 3087 Shuffle'm Up
来源:互联网 发布:地图点聚合算法 编辑:程序博客网 时间:2024/06/05 04:41
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
题意:
给定两个长度为len的字符串s1和s2, 接着给出一个长度为len*2的字符串s12。
将字符串s1和s2通过一定的变换变成s12,找到变换次数
变换规则如下:
假设s1=12345,s2=67890
变换后的序列 s=6172839405
如果s和s12完全相等那么输出变换次数
如果不完全相等,s的前半部分作为s1,后半部分作为s2,重复上述过程。
分析:
直接模拟整个过程
code:
#include <iostream>#include <stdio.h>#include <string>#include <string.h>using namespace std;string str1,str2,str3,str12;void mix(string s1,string s2){ //混合过程 int i,k=0; for(i=0;i<s1.size();i++){ str12[k++]=s2[i]; str12[k++]=s1[i]; }}void fapai(string s3){ //分牌过程 int i,j; for(i=0;i<s3.size()/2;i++) str1[i]=s3[i]; for(i=s3.size()/2,j=0;i<s3.size();i++,j++) str2[j]=s3[i];}int main(){ int n,c,ans=1; cin>>n; while(n--){ int res=0,flag=1; string temp1,temp2,temp12; cin>>c; cin>>str1>>str2>>str12; temp1=str1;temp2=str2;temp12=str12; while(1){ mix(str1,str2); res++; if(str12!=temp12){ fapai(str12); if(str1==temp1&&str2==temp2){ //如果某次发完牌之后与初始状态一致,即到了循环点 flag=0; cout<<ans++<<" "<<-1<<endl; break; } }else break; } if(flag) cout<<ans++<<" "<<res<<endl; } 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
- [JavaGets]
- 轻量型编辑器 使用wangEditor富文本编辑器
- [七月英语总结]-多一分耐心
- (2) cordova第一个项目 安全问题
- caffe 报错 Check failed: error == cudaSuccess (77 vs. 0) an illegal memory access was encountered
- poj 3087 Shuffle'm Up
- ROC和AUC介绍以及如何计算AUC
- poj3624 01背包裸题
- Hibernate一对多单向关联和双向关联映射方法及其优缺点
- 圆拟合与点云数据球拟合算法
- C++ STL基本容器的使用
- 深度学习核心技术应用与开发
- 【解决】jsPDF之长图片生成PDF(分页,失真)
- intellij idea svn不能更新和提交