Shuffle'm Up
2016-01-10 16:49
337 查看
算法:BFS(简单)
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
代码:
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
代码:
#include <iostream> #include <cstring> #include <iomanip> #include <algorithm> #include <stdio.h> #include <queue> #include <string> using namespace std; int n,m,w; char c1[105],c2[105],c3[205],c4[105],c5[105]; struct dot { char ch[205]; int step; } ; void BFS() { queue<dot>que; dot cur,loer; int j=0; for(int i=0;i<n;i++) { cur.ch[j++]=c2[i]; cur.ch[j++]=c1[i]; } cur.step=1; que.push(cur); while(que.size()) { loer=que.front(); que.pop(); int k=0; for(int i=0;i<=2*n-1;i++) { if(loer.ch[i]!=c3[i]) { k=1; break; } } if(k==0) { w=1; cout<<loer.step<<endl; break; } else { int p=0,q=0; for(int i=0;i<n;i++) { c4[i]=loer.ch[i]; if(c4[i]!=c1[i]) p=1; } for(int i=n;i<=2*n-1;i++) { c5[i-n]=loer.ch[i]; if(c5[i-n]!=c2[i-n]) q=1; } if(!p&&!q) break; int j=0; for(int i=0;i<n;i++) { cur.ch[j++]=c5[i]; cur.ch[j++]=c4[i]; } cur.step=loer.step+1; que.push(cur); } } } int main() { int t,i,j,k=0; cin>>t; while(t--) { cin>>n; cin>>c1>>c2>>c3; w=0; cout<<++k<<" "; BFS(); if(w==0) cout<<"-1"<<endl; } return 0; }
相关文章推荐
- 使用python 加载tkdnd 的库(_load_tkdnd : _tkinter.TclError: couldn't load library )的时候错误的解决措施
- Uoj#35. 后缀排序
- [java面试]宇信易诚 广州分公司 java笔试题目回顾录
- 金山词霸2016.1.3.3 手动去广告方法
- C++学习笔记(二)
- 简单的HTML5音乐播放器(带歌词滚动)
- Java与模式:装饰(Decorator)模式
- 分级基金下折套利风险介绍
- 【慕课笔记】第三章 常用的运算符 第2节 JAVA中的算术运算符
- bzoj 3156 防御准备(斜率DP)
- 在多线程程序中指定线程来处理信号
- Mac下安装MySQL5.7.10,以及字符编码问题
- 解决VMware桥接无法启用
- python入门笔记(Day5)--filter,sorted,lambda,装饰,偏,模块
- 设计模式(一)设计六大原则
- error: expected declaration or statement at end
- 2016年1月10日 写个非计算机专业的小伙伴
- 设计模式之设计六大原则
- 初探JS-html5移动端发送指定内容短信到指定号码
- Swift学习笔记4