poj 3087 Shuffle'm Up
2013-11-12 19:16
381 查看
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
Source
Greater New York 2006
大致题意:两堆纸牌s1, s2,按照洗牌的方式合成一堆(与目标结果相同),输出洗牌次数,如果无法得到输出-1.
解题思路:简单模拟,按照洗牌方式堆字符串进行变换,关于判重问题,就是判断当前状态是否与第一次合并后的状态相同(字符串比较)。
代码:
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 4809 | Accepted: 2283 |
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
Source
Greater New York 2006
大致题意:两堆纸牌s1, s2,按照洗牌的方式合成一堆(与目标结果相同),输出洗牌次数,如果无法得到输出-1.
解题思路:简单模拟,按照洗牌方式堆字符串进行变换,关于判重问题,就是判断当前状态是否与第一次合并后的状态相同(字符串比较)。
代码:
#include <iostream> #include <string> using namespace std; string s1,s2,orig, res, need; char tmp[202]; int main() { int n, m, step; bool flag; cin>>n; for (int i=1; i<=n; ++i) { cin>>m; cin>>tmp; s1 = tmp; cin>>tmp; s2 = tmp; cin>>tmp; need = tmp; cout<<i<<' '; orig = ""; orig = s1+s2; if (orig == need) { cout<<0<<endl; continue; } step = 0; flag = false; while (true) { res = ""; for (int j=0; j<m; ++j) { res += s2[j]; res += s1[j]; } step++; if (res == need) { flag = true; break; } if (res == orig) { break; } s1 = res.substr(0,m); s2 = res.substr(m, m); } if (flag) cout<<step<<endl; else cout<<-1<<endl; } return 0; }
相关文章推荐
- 【poj 3087】 Shuffle'm Up 题意&题解&代码(C++)
- POJ 3087 Shuffle'm Up (模拟)
- POJ 3087 Shuffle'm Up
- POJ 3087-Shuffle'm Up(map+模拟)
- POJ 3087 Shuffle'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 (kuangbin带你飞--简单搜索)
- POJ 3087 *** Shuffle'm Up
- [kuangbin带你飞]专题一 简单搜索G - Shuffle'm Up(POJ 3087)
- POJ-3087 Shuffle'm Up 解题报告(陈小宾)
- POJ 3087 Shuffle'm Up(洗牌)
- Shuffle'm Up poj 3087
- POJ 3087 Shuffle'm Up(简单模拟)
- Poj 3087 Shuffle'm Up
- G - Shuffle'm Up POJ 3087 模拟洗牌的过程,算作暴力搜索也不为过
- POJ 3087_Shuffle'm UP