POJ-3087-Shuffle'm Up
2015-07-09 17:42
351 查看
Shuffle'm Up
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
Sample Output
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 7048 | Accepted: 3281 |
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
2 4 AHAH HAHA HHAAAAHH 3 CDE CDE EEDDCC
Sample Output
1 2 2 -1
#include <stdio.h> #include <iostream> #include <string.h> #include <string> #include <queue> #include <map> using namespace std; queue <char>q1; queue <char>q2; map <string,int>my_q3; int k; string s1,s2,s3,q3; void xipai() { while(!q1.empty()) q1.pop(); while(!q2.empty()) q2.pop(); my_q3.clear(); bool flag=false; int cnt=0; while(1) { cnt++; for(int i=0;i<k;i++) { q1.push(s1[i]); q2.push(s2[i]); } q3.clear(); for(int i=0;i<k;i++) { q3+=q2.front(); q2.pop(); q3+=q1.front(); q1.pop(); } if(!my_q3[q3])//一旦出现重复,就说明不能找出,直接结束 { my_q3[q3]++; } else { flag=true; break; } if(s3==q3) { printf("%d\n",cnt); break; } else { s1="";//先清空 s2=""; for(int i=0;i<k;i++)//再次拆开 { s1+=q3[i]; } for(int i=k;i<2*k;i++) { s2+=q3[i]; } } } if(flag) { printf("-1\n"); } } int main() { int cnt=1,n; scanf("%d",&n); while(n--) { scanf("%d",&k); cin>>s1>>s2>>s3; printf("%d ",cnt++); xipai(); } return 0; }
相关文章推荐
- sql server 2008 故障转移群集
- IOS设备MDM证书申请流程
- 比较实用的几个网站收藏 不定期更新
- 手斧Linux – 从LFS到Funtoo (134)
- VS2012通过ThoughtWorks-GO自动构建出现error MSB4018问题
- RichTextBox设置颜色。因为页面的光标移动后,显示的颜色变成黑色。
- ZooKeeper实践方案:(7) 分布式锁
- 手机移动端alert替换方案
- 学生成绩管理系统
- ACM—N皇后问题
- android 获取屏幕大小
- CustomBuild:拒绝访问。 error MSB6006: "cmd.exe" exited with code 1.
- [MFC]串行化CArchive类
- [iOS]ARC下循环引用的问题
- 基于jQuery仿淘宝产品图片放大镜代码
- 解决浏览器窗口变小后右侧出现空白背景颜色或者图片不能全屏填充的方法
- 前台的json数组转化为List<T>集合
- Swift开发教程--Unused variable 'fileName'问题的解决
- Safari浏览器获取iPhone UDID
- Windows Server 2008 R2 NTP Server