【宽搜】The Clocks 时钟 (Usaco_Training 1.4)

最新推荐文章于 2018-06-24 10:19:34 发布

jiangzh7

最新推荐文章于 2018-06-24 10:19:34 发布

阅读量715

点赞数

分类专栏：搜索

本文链接：https://blog.csdn.net/jiangzh7/article/details/8154456

版权

这是一个关于IOI'94的编程挑战，目标是找到最小的钟表指针转动序列，使9个钟全部回到12点。问题通过宽度优先搜索（BFS）求解，利用数组而非字符串记录方案以优化性能，并在达到4次转动时进行剪枝。C++代码实现需考虑严格的输出格式。

摘要由CSDN通过智能技术生成

The Clocks
IOI'94 - Day 2

Consider nine clocks arranged in a 3x3 array thusly:

|-------|    |-------|    |-------|    
|       |    |       |    |   |   |    
|---O   |    |---O   |    |   O   |          
|       |    |       |    |       |           
|-------|    |-------|    |-------|    
    A            B            C

|-------|    |-------|    |-------|
|       |    |       |    |       |
|   O   |    |   O   |    |   O   |
|   |   |    |   |   |    |   |   |
|-------|    |-------|    |-------|
    D            E            F

|-------|    |-------|    |-------|
|       |    |       |    |       |
|   O   |    |   O---|    |   O   |
|   |   |    |       |    |   |   |
|-------|    |-------|    |-------|
    G            H            I

The goal is to find a minimal sequence of moves to return all the dials to 12 o'clock. Nine different ways to turn the dials on the clocks are supplied via a table below; each way is called a move. Select for each move a number 1 through 9 which will cause the dials of the affected clocks (see next table) to be turned 90 degrees clockwise.

Move

Affected clocks

ABDE