与‘基础算法-搜索(DFS\BFS)\记忆化’有关的日志

zoj1403

maksyuki 发表于 oj 分类,标签: ,
0
zoj1403

Safecracker

=== Op tech briefing, 2002/11/02 06:42 CST ===

"The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, along with Klein and his factory, were destroyed in World >>继续阅读

zoj1091

maksyuki 发表于 oj 分类,标签:
0
zoj1091

Knight Moves

A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the >>继续阅读

lightoj1337

maksyuki 发表于 oj 分类,标签:
0
lightoj1337

1337 - The Crystal Maze

To be more exact, the maze can be modeled as an M x N 2D grid where M denotes the number of rows and N denotes the number of columns. There are three types of cells in the grid:You are in a plane and you are about to be drop >>继续阅读

lightoj1012

maksyuki 发表于 oj 分类,标签:
0
lightoj1012

1012 - Guilty Prince

For simplicity, you can consider the place as a rectangular grid consisting of some cells. A cell can be a land or can contain water. Each time the prince can move to a new cell from his current position if they share a side.On >>继续阅读