POJ - 3087(BFS,STL)

ChenTepic

于 2018-07-06 21:32:45 发布

阅读量595

点赞数 1

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/qq_40764917/article/details/80946385

该博客讨论了一种常见的扑克牌洗牌游戏，其中玩家将两个含有相同数量（C）不同颜色筹码的堆混合在一起。博客介绍了洗牌过程，并提出一个问题：通过多次洗牌操作能否达到特定的筹码堆配置。博主给出了输入输出格式，包括数据集的数量、每个数据集的初始筹码堆颜色以及目标筹码堆颜色。他们解释了样例输入和输出，并指出可以使用BFS（广度优先搜索）策略来解决这个问题，同时建议使用队列和标记集合来实现。最后，博主分享了他们的AC（Accepted）代码，即通过了所有测试用例的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接：http://poj.org/problem?id=3087

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 u