POJ - 3087 - Shuffie'm Up (搜索,模拟)
2017-11-20 16:42
465 查看
Shuffle'm Up
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 Cchips. 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 * Cuppercase 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 Source Greater New York 2006 |
输出的是这次是第几个输入以及最少洗多少次达到目标扑克,若不能达到则输出-1
洗扑克规则:
就是s1 s2 你一张我一张,然后最下面的是s2的,然后再将合起来的2n张扑克分为两半,上半部分为s2,下半部分为s1,然后继续洗牌
直接DFS 而且只有一个方向,所以写起来还是很容易的,标记用map
#include<iostream> #include<string.h> #include<stdio.h> #include<map> using namespace std; int T,n,cas,ans; string s1,s2,s3; map<string,int>vis; void dfs(string s,int step){ if((ans!=-1&&step>=ans)||vis[s]) return; if(s==s3) {ans = step;return;} vis[s] = 1; string ss = ""; for(int i=0; i<n; i++){ ss += s[i+n]; ss += s[i]; } dfs(ss,step+1); } int main() { for(scanf("%d",&T),cas = 0;T--;){ ans = -1; vis.clear(); cin>>n>>s1>>s2>>s3; string s = ""; for(int i=0; i<n; i++){ s += s2[i];s += s1[i]; } dfs(s,1); printf("%d %d\n",++cas,ans); } return 0; }
相关文章推荐
- POJ - 3087 Shuffle'm Up(15.10.10 搜索专题)模拟
- [kuangbin带你飞]专题1 简单搜索 G - Shuffle'm Up POJ - 3087
- POJ 3087Shuffle'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(字符串模拟)
- N - Shuffle'm Up POJ - 3087——模拟
- POJ训练计划3087_Shuffle'm Up(模拟)
- Shuffle'm Up (poj 3087 模拟)
- poj 3087 Shuffle'm Up ( map 模拟 )
- 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(模拟) (G)
- poj 3087 Shuffle'm Up (模拟搜索)
- G - Shuffle'm Up POJ 3087 模拟洗牌的过程,算作暴力搜索也不为过