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

49愛的鼓勵 6訂閱站台

Problem B
Avoiding Your Boss
Input: standard input
Output: standard output
Time Limit: 4 seconds
Memory Limit: 32 MB

Imagine that like me you are also an idle but reasonably good programmer. On one fine morning you wake up from sleep and discover that your bed is such a lovely place and you must not leave it for the miserable place called office. So you just pick up your mobile phone, call your boss with a gloomy voice and tell him that you are quite sick. Your boss is a very strict but sympathetic person and so he grants you leave via phone. As the day grows old you discover that you must go out for shopping. But you are afraid that your boss might see you. So you need to know if there is any safe option to reach the market. You know that your boss stays only in two places, his residence and the office. While going from one place to another he uses a path that does not cost more than any other path. So you must avoid such paths and even places that your boss may reach. Your boss must not see you outside your home. You can assume that the cost of reaching another location in the same place is zero and you must go outside your home to reach market and your boss must come outside to reach home (from office) or office (from home). As your job is at stake so you cannot take any chances.

Input

The input file contains several sets of input. Each set of input starts with six integers P, R, BH, OF, YH and M. Here

                P = Total number of places. (0<P<=100)

                R = Total number of connecting roads. (0<=R<=4950)

                BH = The Place where your boss lives. (0<BH<=P)

                OF = The place where your office is situated. (0<OF<=P)

                YH = The place where your home is situated. (0<YH<=P)

                M = The place where the market is situated. (0<M<=P)

Next R lines contain description of the city. Each line contains three integers p1, p2 and d. These three integers denote that place p1 and place p2 is connected by a road whose cost is d. Here (0<p1, p2<=P) and d is a positive integer less than 101. Streets are all bi-directional. You can assume that two different places are connected by only one road. Input is terminated by end of file.

Output

For each set of input produce one line of output. This line contains the cost of going from your home to the market. If it is not possible for you to go to the market avoiding your boss print the line ‘MISSION IMPOSSIBLE.’ (Without the quotes).

Sample Input
3 2 2 3 1 3

1 2 4

2 3 4

3 2 2 3 3 3

1 2 4

2 3 4

4 3 2 3 1 4

1 2 4

2 3 4

1 4 10

Sample Output
MISSION IMPOSSIBLE.

MISSION IMPOSSIBLE.

10

Shahriar Manzoor

題目描述：

老闆會在他的住所與辦公室的最短路上，身為員工想要從家裡去市場，但不能遇到老闆的最短路為何？

題目解法：

由於老闆會經過在最短路上的所有點(可能有數條最短路)

對於這些點被標記不可走，然後再做一次最短路即可。