poj 3087 (模拟)
来源:互联网 发布:c语言教程 it教程网 编辑:程序博客网 时间:2024/05/29 04:03
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
24AHAHHAHAHHAAAAHH3CDECDEEEDDCC
Sample Output
1 22 -1
Source
题意:给你2副牌,各有c张,互相叠牌,每次叠一张,s2先叠,s1后叠。最后叠成2*c的新牌,问最少几次可以到达最终状态。如何可以就输出最少次数,不能那就输出-1
题解:其实是很简单的模拟题。这里需要注意的是:我们不需要的将已经搜索过的状态又重新模拟一次,那么使用map,或者set判断重复就可以了
#include<cstdio> #include<cstring> #include<cstdlib> #include<cmath> #include<iostream> #include<algorithm> #include<vector> #include<map> #include<set> #include<queue> #include<string> #include<bitset> #include<utility> #include<functional> #include<iomanip> #include<sstream> #include<ctime> using namespace std; #define N int(2000) #define inf int(0x3f3f3f3f) #define mod int(1e9+7) typedef long long LL; set<string>st;char s1[N],s2[N],tmp[N];char des[N<<1],stk[N];int main() { #ifdef CDZSC freopen("i.txt", "r", stdin); //freopen("o.txt","w",stdout); int _time_jc = clock(); #endif int n,c;scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&c);stk[2*c]='\0';st.clear();scanf("%d",&c);scanf("%s%s%s",s1,s2,des);int ans=0,ok=0;int num=0;for(int i=0;i<c;i++){stk[num++]=s2[i];stk[num++]=s1[i];}while(!st.count(string(stk))){st.insert(string(stk));ans++;if(strcmp(stk,des)==0){ok=1;break;}else{int p=0;tmp[2*c]='\0';strcpy(tmp,stk);for(int i=0;i<c;i++){stk[p++]=tmp[i+c];stk[p++]=tmp[i];}}}printf("%d %d\n",i,ok?ans:-1);} return 0; }
- POJ 3087(模拟)
- poj 3087 (模拟)
- POJ 3087 Shuffle'm Up(模拟)
- POJ 3087 Shuffle'm Up (模拟)
- POJ 3087 Shuffle'm Up(模拟)
- POJ 3087 Shuffle'm Up(模拟)
- (水)POJ-3087 模拟,map,string
- POJ 3087 (简单map + 模拟)
- poj 3087 Shuffle'm Up(模拟)
- POJ 3087Shuffle'm Up(模拟)
- POJ 3087 Shuffle'm Up (模拟)
- POJ 3087 Shuffle'm Up(模拟)
- POJ.3087 Shuffle'm Up (模拟)
- poj 3087 模拟
- poj 3087 模拟
- poj 3087 模拟题
- 【模拟】POJ 3087
- POJ 3087 模拟+hash
- CCF 最优灌溉
- PHP设计模式
- 大坑之 resultMap = Long
- Blue Jeans (HDU_3080) KMP + 枚举
- svn
- poj 3087 (模拟)
- PAT (Advanced Level) Practise 1067 Sort with Swap(0,*) (25)
- Problem F-1005
- JAVA设计模式:简单静态工厂方法模式
- IOS 在AppDelegate 页面中push到另一个页面
- linux按键驱动
- zjnu1749 PAROVI (数位dp)
- 《HTML+CSS基础课程》学习笔记一
- PHP中如何获取字符串的长度