Shuffle'm Up
来源:互联网 发布:qq飞车噬魂金甲数据 编辑:程序博客网 时间:2024/06/05 06:36
PS:
看同学博客水过去的~~~, 提议就是不断的交叉互换卡牌, 求得到目标卡牌的步数
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<iostream>#include<cstdio>#include<map>#include<string.h>using namespace std;int main(){ char a[10086], b[10086], key[10086], temp[1008611]; int ans, kase, n; int i, T; kase = 0; cin >> T; while(T --) { kase ++; map<string, int>Map; memset(a, 0, sizeof(a)); memset(b, 0, sizeof(b)); memset(key, 0, sizeof(key)); memset(temp, 0, sizeof(temp)); cin >> n; cin >> a >> b >> key; bool flag = false; ans = 0; while(1) { int k = 0; ans ++; for (i = 0; i <= n - 1; i ++) { temp[k ++] = b[i]; temp[k ++] = a[i]; } // 交叉赋值成为新卡牌 temp[k] = '\0'; if (strcmp(temp, key) == 0) { flag = true; break; } if (Map.find(temp) != Map.end()) { break; } Map[temp] = 0; for (i = 0; i <= n - 1; i ++) { a[i] = temp[i]; b[i] = temp[i + n]; } } if (flag == true) cout << kase << " " << ans << endl; else cout << kase << " " << "-1" << endl; }}
- POJ3087 Shuffle'm Up
- poj3087 Shuffle'm Up
- I - Shuffle'm Up
- poj3087 - Shuffle'm Up
- POJ3087 Shuffle'm Up
- POJ3087--Shuffle'm Up
- hdu Shuffle’m up
- Shuffle'm Up
- poj3087 Shuffle'm Up
- POJ3087---Shuffle'm Up
- Shuffle'm Up
- Shuffle'm Up
- Shuffle'm Up
- POJ3087 Shuffle'm Up
- POJ3087-Shuffle'm Up
- Shuffle'm Up(模拟)
- Shuffle'm Up
- Shuffle'm Up POJ
- 数组和链表的区别,数组和指针的区别
- Java类和对象 详解(一)
- Bridging signals
- 电脑桌面图片变成白色的解决方案
- C#连接MySQL数据库
- Shuffle'm Up
- Java中的枚举类型
- 为什么GitHub Contribution Activity没有没有统计贡献
- 搭建SSH框架遇到的问题汇总
- 为什么你的 Contributions 没有在你的 Profile 里显示?
- 模拟水题2
- Xamarin.Forms 用户界面——控件——主题——Dark Theme
- POJ
- mysql外键(Foreign Key)介绍和创建外键的方法