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

49愛的鼓勵 6訂閱站台

After the great winger Donaldo left his soccer team, coach sir Thelex has found himself in a great fix. The strength of his team is reduced greatly and he needs to find a suitable replacement immediately. The coach selects a number of young wingers from around the world and sets up a trial for them.

The trial will take place on a rectangular shaped field of length L meters & width W meters. There are N robot defenders placed on the field. The defenders do not change their positions but if a winger's distance from a defender is not more than d meters, it will automatically tackle him. A robot defender may tackle at most once. On the beginning of the trial, a winger stands on the left edge of the field (across the length) with a soccer ball. Now, his task is to avoid the obstructions of the robot defenders and reach the rightmost edge of the field with the ball. Please tell him the minimum number of tackles he must face in order to reach the opposite end. A player must not go outside the field or he will be disqualified.

Input

Every test case begins with 4 integers, L (1<=L<=10000), W (1<=W<=10000), N (1<=N<=100) & d (1<=d<=1000), as described above. Each of the following N lines contain 2 integers each, defining the x & y co-ordinates of a defender. You can consider the co-ordinate of the lower-left corner of the field to be (0,0) and upper-right corner to be (L,W). Obviously, all the defenders are located inside the field.

The end of input will be marked by a case with L=W=N=d=0. This case should not be processed.

Output

For each test case, print a line in the format, “Case X: Y”, where X is the case number & Y is the minimum number of tackles that needs to be dealt with.

Problem Setter: Mohammad Mahmudur Rahman, Special Thanks: Manzurur Rahman Khan

題目描述：

一個足球員和一群擬真的機器人，每個機器人的勢力範圍限定一個圓，

問足球員最少要進行幾次剷球，才能將球從左邊運道右邊。

題目解法：

一樣打算將這些機器人當作節點，而考慮將可以防守的兩點連線。

同時上下兩邊也各當作一點看待。

此時最少剷球次數即該圖的最小割，但必須知道剷球一次是跨越一個機器人，也就是權重是放在點上的。

最小割 = 最大流