POJ 3087 Shuffle'm Up 模拟
来源:互联网 发布:appscan 数据库 编辑:程序博客网 时间:2024/06/14 18:22
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 forC = 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 from S1. The interleaving process continues taking the 2nd chip from the bottom ofS2 and placing that on S12, followed by the 2nd chip from the bottom ofS1 and so on until the topmost chip from S1 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 topmost C chips fromS12 to form a new S2. 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
[Submit] [Go Back] [Status] [Discuss]
分析:很简单的模拟题
AC code:
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <vector>#include <queue>#include <stack>#include <string>#include <map>using namespace std;#define LL __int64#define INF 0x3f3f3f3f#define eps 1const int mod=1000000000+7;const int maxn=1000000+50;char s1[105],s2[105],end[205];int bfs(){ map<string,int> m; int len=strlen(s1); int step=0; while(true){ char s[205]; step++; int cnt=0; for(int i=0;i<len;i++){ s[cnt++]=s2[i]; s[cnt++]=s1[i]; } s[cnt]='\0'; if(strcmp(s,end)==0) return step; if(!m[s]) m[s]=1; else return -1; for(int i=0;i<len;i++){ s1[i]=s[i]; } for(int i=len,j=0;i<len*2;j++,i++){ s2[j]=s[i]; } }}int main() { int t; scanf("%d",&t); for(int i=1;i<=t;i++){ int n; scanf("%d",&n); scanf("%s%s%s",s1,s2,end); printf("%d %d\n",i,bfs()); } 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 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 - 模拟
- POJ 3087 Shuffle'm Up(模拟)
- 模拟-POJ-3087-Shuffle'm up
- POJ 3087-Shuffle'm Up(map+模拟)
- poj-3087-Shuffle'm Up-模拟
- 删除数字
- 第8章 图形化显示地震危机数据(海地)
- 20171206 水仙花数<一>
- android的阻尼效果-ListView添加阻尼效果的HeadView
- 1003. 我要通过!(20)
- POJ 3087 Shuffle'm Up 模拟
- JAVA | 54
- jdk源码序言
- leetcode 27. Remove Element移出元素(双指针)
- 命令行下【打jar包】&【引用jar包】简单使用
- CENTOS最小版netstat命令找不到及xshell不能连接虚拟机问题解决
- ueditor.all.min.js报错,jquery.min.js报错,等等一些js文件报错
- 操作系统基础10问
- Firewalld