poj 3087 Shuffle'm Up(模拟题)
来源:互联网 发布:存放数据库数据的是 编辑:程序博客网 时间:2024/04/30 05: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 2ndchip 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
Source
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<string>#include<algorithm>#include<cstdlib>#include<set>#include<queue>#include<stack>#include<vector>#include<map>#define N 100010#define Mod 10000007#define lson l,mid,idx<<1#define rson mid+1,r,idx<<1|1#define lc idx<<1#define rc idx<<1|1const double EPS = 1e-11;const double PI = acos ( -1.0 );const double E = 2.718281828;typedef long long ll;const int INF = 1000010;using namespace std;char s1[111],ss1[111],s2[111],ss2[111],s12[222],s22[222];int C;void build(){ for(int i=0; i<C; i++) s1[i]=s12[i]; for(int i=0,j=C; i<C; j++,i++) s2[i]=s12[j];}void build_2(){ for(int i=0,j=0; j<C; i+=2,j++) { s12[i]=s2[j]; s12[i+1]=s1[j]; }}int finds(){ int step=0; while(1) { build_2(); step++; if(strcmp(s12,s22)==0) return step; build(); if(strcmp(s1,ss1)==0&&strcmp(s2,ss2)==0) return -1; } return -1;}int main(){ int T; while(~scanf("%d",&T)) { int ca=1; while(T--) { scanf("%d ",&C); scanf("%s%s%s",s1,s2,s12); strcpy(ss1,s1); strcpy(ss2,s2); strcpy(s22,s12); printf("%d %d\n",ca++,finds()); } } 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(模拟)
- 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(map+模拟)
- C#基础知识系列三(类和结构体、String和StringBuilder、equals和==)
- 变量定义错误
- oracle动态游标实现动态SQL循环遍历
- uva 11524 - InCircle(几何)
- 只会CSS还不够,LESS、SASS、BootStrap、Foundation一网打尽!
- poj 3087 Shuffle'm Up(模拟题)
- C#基础知识系列四(运算符汇总)
- 嵌入式软件总体架构
- 各种数据库的连接情况
- Python爬取大网站遇到的问题
- 同域跨页面监听
- C#基础知识系列五(构造函数)
- 后端渲染神器!Dust
- C#基础知识系列六(静态类和静态类成员)