Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

Problem H
Knights' Nightmare
Input: standard input
Output: standard output
Time Limit: 5 seconds

The people of the remote country KnightLand are crazy about chess. They play chess whenever they get some free time. They have even divided their land into adjacent equal sized squares just like a chessboard. They like the knight of chess so much that they always go from one place to another following a knight's trail, even if it takes a lot of time and energy. In a minute, a KnightLander can make only one jump from one square to another like a knight.

For the past few years, the people of KnightLand are facing a serious problem. A monster has appeared in one of the squares of KnightLand. When it is awake, it eats anyone who enters its square. The good thing is, the monster doesn't move from one square to another and loves to sleep. If one enters its square while it is sleeping, it wakes up and forgets for a year how to sleep. It is remains sleepy for a minute and cannot do any harm to anyone in this time. It then starts eating anyone it gets in its square. Therefore, the person who makes it awake can escape safely from it. But if one comes to that square later, he dies a terrible death.

In order to solve the problem, the 4 leaders of KnightLand are planning to meet together. They want to find a square that can be reached safely and as quickly as possible from the squares where they line in. To be extra careful, they decided that there should not be more than 1 jump in a minute in the whole KnightLand. Now, they want to find out if it is at all possible to meet at any square, and the minimum time required to get there.

Can you help them?

Input

Input consists of multiple test cases and terminated by an EOF. Each test case consists of 4 lines. The first line contains the string "Set#n", where n is the set number. The second line contains number of rows r and number of columns c of squares in KnightLand's map (where 3 <= r <= 16 and 3 <= c <= 16). The third line contains position of each leader in the map, in terms of row# and column# of each. The fourth line gives the position of the monster. Note that the square at the upper left corner of the map has (row#,column#) = (1,1). You may assume that no leader resides in the same square as the monster.

Output

For each set of input, there should be 2 lines of output. The first line should contain the string "Set#n", where n is the set number. The second line should give the minimum time in minutes needed to reach a square (in format shown below), or the string "Meeting is impossible.", whichever is applicable.

Sample Input

Set#1

5 5

1 1 1 5 5 1 4 4

3 3

Set#2

3 3

1 1 1 2 1 3 2 2

3 2

Sample Output

Set#1

Minimum time required is 6 minutes.

Set#2

Meeting is impossible.

Problem setter: Mustaq Ahmed, University of Waterloo, Canada

“To make a very good problem (To generate a good idea, writing an error free

statement and solution) one needs at least 3/4 days of time. The situation

gets even worse when one is asked to set problem from a particular

field. I hope the non-problem setters will understand it soon.”