Shuffle'm Up poj 3087 bfs
来源:互联网 发布:吉林快三遗漏数据 编辑:程序博客网 时间:2024/04/29 04:43
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 S2starting 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
#include<cstring>#include<cstdio>#include<iostream>using namespace std;#include<map>int main(){ char s[444],s1[244],s2[244],s3[444]; map<string,int>mp; int n; cin>>n; for(int i=1;i<=n;i++) { mp.clear(); int sum=0; int m; cin>>m; cin>>s1>>s2>>s; while(1) { int l=0; sum++; for(int j=0;j<m;j++) { s3[l++]=s2[j]; s3[l++]=s1[j]; } s3[l]='\0'; if(strcmp(s3,s)==0) { printf("%d %d\n",i,sum); break; } else if(mp[s3])//用map记录该状态是否被访问过,如果被访问过则说明出现循环,到达不了目标状态。 { printf("%d -1\n",i); break; } mp[s3]=1; strncpy(s1,s3,m); s1[m]='\0'; strncpy(s2,s3+m,2*m); s2[m]='\0'; } }}
#include<iostream>#include<cstring>#include<map>using namespace std;map<string,int>mp;int main(){ int t; cin>>t; int cnt=1; while(t--) { mp.clear(); int n; cin>>n; string s1,s2,s3,s; cin>>s1>>s2>>s; int ans=0; int t=0; while(1) { s3=""; t++; for(int i=0;i<n;i++) { s3=s3+s2[i]+s1[i]; } if(mp[s3]) { ans=-1;break; } else if(s3==s) { ans=t; break; } else { mp[s3]=1; s1=s3.substr(0,n); s2=s3.substr(n,n); } } cout<<cnt++<<" "<<ans<<endl; }}
- Poj 3087 Shuffle'm Up 【BFS】
- poj 3087 Shuffle'm Up(bfs)
- POJ 3087 Shuffle'm Up(BFS)
- Shuffle'm Up poj 3087 bfs
- POJ 3087 Shuffle'm Up(BFS +模拟)
- 【BFS】POJ 3087 Shuffle'm Up
- 【POJ 3087】Shuffle'm Up(BFS,模拟,)
- 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 3087Shuffle'm Up
- poj 3087 Shuffle'm Up
- Shuffle'm Up poj 3087
- POJ 3087 Shuffle'm Up
- nodepad++ 行首行尾添加字符
- Robi改造计划更新---框架可以动了
- Java代理模式(动态与静态)
- 刻度设置
- C# 深入理解堆栈、堆在内存中的实现
- Shuffle'm Up poj 3087 bfs
- 深度学习文章4:计算图像数据集的均值
- [转载]Lua 内存泄露举例
- GIT第一讲 基础和安装
- Android Toast自定义
- 按照文件扩展名排列的 Mime 类型列表
- [Android入门]从零构建Android app之天气——7.在欢迎页加载并缓存数据
- httpclient https忽略证书
- 开源软件七大盈利模式